Data structures and algorithm book


Balance the balance
Lowest common ancestor
Sum of child nodes
Lowest common ancestor without root
Binary tree zigzag print
Print Binary tree bottom to top
Binary tree bottom to top level wise
Print Nodes of the same level
Linked list with inorder successor
Linked list with preorder successor
Linked list with postorder successor
Binary tree to linked list
Is the binary tree BST
Create tree from in and pre
Find root to node path
Find distance between two nodes
SuperImpose Binary Tree
Is a sum possible along any path
Remove duplicate infinite integer
Find deepest level nodes
Maximum sum path positive
Maximum sum path negative
Find Kth smallest in BST
BST with insertion order
Binary tree sum of odd levels
Level order without queue
Print level with maximum nodes
Find all wrong pairs in a BST