## Level Order Traversal or Breadth First Search (BFS):

- Binary tree traversal – Level Order Traversal or Breadth First Search Algorithm (BFS)
- Find level in binary tree having maximum sum
- Find sum of nodes in binary tree
- Find height of binary tree
- Find number of nodes or size of binary tree
- Count non-leaf nodes (left & right child) in binary tree
- Count non leaf nodes in binary tree having one child node
- Count non leaf nodes in binary tree
- Find number of leaf nodes in a binary tree
- Find maximum/ largest element in a binary tree
- Check leaf nodes of binary tree are at same level
- Find level of given node in binary tree
- Find maximum width of binary tree
- Spiral or Zigzag binary tree traversal
- Print binary tree in reverse order

## Depth First Search Algorithm:

- Binary tree traversal algorithm (preOrder /postOrder/inOrder)
- Find number of nodes or size of binary tree
- Find diameter of binary tree
- Find minimum & maximum element in binary tree
- Find height of binary tree in java
- Delete all nodes of a binary tree in java
- Find root to leaf path sum equals given number binary tree
- Find maximum sum in root to leaf path in binary tree
- Print vertical order traversal of binary tree
- Find vertical order sum in a binary tree
- Connect nodes at same level (set next sibling) in a binary tree
- LCA (Lowest common ancestor) in a binary tree
- Print ancestors of node in a binary tree
- Print paths from root to leaf nodes in binary tree
- Print nodes at k distance from root in binary tree
- Print nodes K distance from leaf nodes in a binary tree
- Check two binary trees are equal or identical or same
- Check given binary trees are Isomorphic
- Check binary tree is Quasi-Isomorphic of other tree
- Check given binary tree is mirror or symmetric tree
- Convert binary tree to mirror/symmetric tree