Top 25 Interview Problems on Binary Trees/Binary Search Trees

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

Top Companies Interview Questions..-


If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment.

%d bloggers like this: