archgaelix
Uses
Archive
bt
Invert Binary Tree
#bt
#easy
Balanced Binary Tree
#bt
#easy
Diameter of Binary Tree
#bt
#easy
Maximum Depth of Binary Tree
#bt
#easy
Binary Tree Level Order Traversal
#bt
#medium
Lowest Common Ancestor of a Binary Tree
#bt
#medium
Binary Tree Right Side View
#bt
#medium
Construct Binary Tree from Preorder and Inorder Traversal
#bt
#medium
Serialize and Deserialize Binary Tree
#bt
#hard
Level order traversal
#bt
Reverse level order traversal
#bt
Height of a tree
#bt
Diameter of a tree
#bt
Mirror of a tree
#bt
Inorder traversal of a tree
#bt
Preorder traversal of a tree
#bt
Postorder traversal of a tree
#bt
Right view of a tree
#bt
Left view of a tree
#bt
Top view of a tree
#bt
Bottom view of a tree
#bt
Zig-zag traversal of a binary tree
#bt
Check if a tree is balanced
#bt
Diagonal traversal of a binary tree
#bt
Boundary traversal of a binary tree
#bt
Construct binary tree from string with bracket representation
#bt
Convert binary tree into doubly linked list
#bt
Convert binary tree into sum tree
#bt
Construct binary tree from inorder and preorder traversal
#bt
Find minimum swaps required to convert a binary tree into BST
#bt
Check if binary tree is sum tree
#bt
Check if all leaf nodes are at same level
#bt
Check if a binary tree contains duplicate subtrees of size 2 or more
#bt
Check if 2 trees are mirror
#bt
Sum of nodes on the longest path from root to leaf node
#bt
Check if given graph is tree
#bt
Find largest subtree sum in a tree
#bt
Maximum sum of nodes in binary tree such that no two are adjacent
#bt
Print all K sum paths in a binary tree
#bt
Find LCA in a binary tree
#bt
Find distance between 2 nodes in a binary tree
#bt
Kth ancestor of node in a binary tree
#bt
Find all duplicate subtrees in a binary tree
#bt
Tree isomorphism
#bt