| 1 |
level order traversal |
| 2 |
Reverse Level Order traversal |
| 3 |
Height of a tree |
| 4 |
Diameter of a tree |
| 5 |
Mirror of a tree |
| 6 |
Inorder Traversal of a tree both using recursion and Iteration |
| 7 |
Preorder Traversal of a tree both using recursion and Iteration |
| 8 |
Postorder Traversal of a tree both using recursion and Iteration |
| 9 |
Left View of a tree |
| 10 |
Right View of Tree |
| 11 |
Top View of a tree |
| 12 |
Bottom View of a tree |
| 13 |
Zig-Zag traversal of a binary tree |
| 14 |
Check if a tree is balanced or not |
| 15 |
Diagnol Traversal of a Binary tree |
| 16 |
Boundary traversal of a Binary tree |
| 17 |
Construct Binary Tree from String with Bracket Representation |
| 18 |
Convert Binary tree into Doubly Linked List |
| 19 |
Convert Binary tree into Sum tree |
| 20 |
Construct Binary tree from Inorder and preorder traversal |
| 21 |
Find minimum swaps required to convert a Binary tree into BST |
| 22 |
Check if Binary tree is Sum tree or not |
| 23 |
Check if all leaf nodes are at same level or not |
| 24 |
Check if a Binary Tree contains duplicate subtrees of size 2 or more [ IMP ] |
| 25 |
Check if 2 trees are mirror or not |
| 26 |
Sum of Nodes on the Longest path from root to leaf node |
| 27 |
Check if given graph is tree or not. [ IMP ] |
| 28 |
Find Largest subtree sum in a tree |
| 29 |
Maximum Sum of nodes in Binary tree such that no two are adjacent |
| 30 |
Print all "K" Sum paths in a Binary tree |
| 31 |
Find LCA in a Binary tree |
| 32 |
Find distance between 2 nodes in a Binary tree |
| 33 |
Kth Ancestor of node in a Binary tree |
| 34 |
Find all Duplicate subtrees in a Binary tree [ IMP ] |
| 35 |
Tree Isomorphism Problem |