Top 25 Interview Problems on Binary Trees/Binary Search Trees

1 Binary Search Tree Complete Implementation. Easy
2 Determine whether given binary tree is binary search tree(BST) or not Medium
3 Sorted Array to Binary Search Tree of Minimal Height Medium
4 Tree Traversals Easy
5 Level Order Traversal, Print each level in separate line. Medium
6 Find whether if a Given Binary Tree is Balanced? Easy
7 Convert BST to Greater Sum Tree Medium
8 Diameter Of a Binary Tree Expert
9 Find If Path Exist in Binary Tree with Sum=X Medium
10 Binary Min — Max Heap Expert
11 Print the Bottom View of a Binary Tree Medium
12 AVL Tree — Insertion Expert
13 Construct a binary tree from given Inorder and Level Order Traversal Expert
14 Construct Binary Search Tree from a given Preorder Traversal using Recursion Expert
15 Print The Top View of a Binary Tree Medium
16 Construct a Binary Tree from Given Inorder and Depth-First-Search. Expert
17 Inorder Predecessor and Successor in Binary Search Tree Expert
18 Construct a binary tree from given Inorder and Postorder Traversal Expert
19 Print the Vertical Sum in binary Tree . Medium
20 Lowest Common Ancestor in a Binary Search Tree. Medium
21 Make a Binary Tree from Given Inorder and Preorder Traveral. Expert
22 Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree. Medium
23 Print Right View of a given binary tree Medium
24 In a Binary Tree, Check if two nodes are Cousins Medium
25 Print Paths from root to all leaf nodes in a binary tree. Medium