Top 25 Problems on Trees # Status Problem Level Completes Likes 1 Check the completeness of given binary tree | Set 2 - Using Level Order Traversal Medium % 0 2 Check the completeness of given binary tree | Set 1 - Using Node Count Medium % 0 3 Check if the given binary tree is Full or not. Beginner % 1 4 Convert BST to Greater Sum Tree Medium % 0 5 Convert binary tree to its Sum tree Medium % 1 6 Binary Tree - Preorder Traversal - Non Recursive Approach Beginner % 0 7 Find the Deepest Left Node in a Binary Tree. Medium % 0 8 Diameter Of a Binary Tree Hard % 1 9 Print All The Full Nodes in a Binary Tree Beginner % 0 10 Construct Binary Search Tree from a given Preorder Traversal using Recursion Hard % 0 11 Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree. Medium % 1 12 Given a binary tree, Convert it into its Mirror Tree Beginner % 0 13 Given a binary tree, Find the Maximum Path Sum between Any Two Leaves Medium % 0 14 Print Right View of a given binary tree Medium % 0 15 In a Binary Tree, Check if Two nodes has the same parent or are siblings Medium % 0 16 In a Binary Tree, Check if two nodes are Cousins Medium % 0 17 Print Paths from root to all leaf nodes in a binary tree. Medium % 0 18 Find the maximum width of a binary tree Medium % 0 19 Determine whether given binary tree is binary search tree(BST) or not Medium % 1 20 Sorted Array to Binary Search Tree of Minimal Height Medium % 1 21 In a Binary Tree, Create Linked Lists of all the nodes at each depth. Hard % 0 22 Find whether a Given Binary Tree is Balanced? Medium % 0 23 Find the Maximum Depth OR Height of a Binary Tree Beginner % 1 Check the completeness of given binary tree | Set 2 - Using Level Order Traversal Check the completeness of given binary tree | Set 1 - Using Node Count Check if the given binary tree is Full or not. Convert BST to Greater Sum Tree Convert binary tree to its Sum tree Binary Tree - Preorder Traversal - Non Recursive Approach Find the Deepest Left Node in a Binary Tree. Diameter Of a Binary Tree Print All The Full Nodes in a Binary Tree Construct Binary Search Tree from a given Preorder Traversal using Recursion Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree. Given a binary tree, Convert it into its Mirror Tree Given a binary tree, Find the Maximum Path Sum between Any Two Leaves Print Right View of a given binary tree In a Binary Tree, Check if Two nodes has the same parent or are siblings In a Binary Tree, Check if two nodes are Cousins Print Paths from root to all leaf nodes in a binary tree. Find the maximum width of a binary tree Determine whether given binary tree is binary search tree(BST) or not Sorted Array to Binary Search Tree of Minimal Height In a Binary Tree, Create Linked Lists of all the nodes at each depth. Find whether a Given Binary Tree is Balanced? Find the Maximum Depth OR Height of a Binary Tree 1
