Top 25 Problems on Trees # Status Problem video Level Completes Likes 443 Check the completeness of given binary tree | Set 2 - Using Level Order Traversal Medium % 0 431 Check the completeness of given binary tree | Set 1 - Using Node Count Medium % 0 425 Check if the given binary tree is Full or not Beginner % 1 189 Convert BST to Greater Sum Tree Medium % 0 183 Convert binary tree to its Sum tree Medium % 1 181 Binary Tree - Preorder Traversal - Non Recursive Approach Beginner % 0 142 Locate the Farthest Left Node on the Bottom Level Medium % 0 134 Diameter Of a Binary Tree Hard % 1 130 Find and Print Full Nodes in a Binary Tree Beginner % 0 97 Construct Binary Search Tree from a given Preorder Traversal using Recursion Hard % 0 69 Convert Sorted Singly Linked List to Balanced Binary Search Tree Medium % 1 68 Transforming a Binary Tree into its Mirror Image Beginner % 0 65 Given a binary tree, Find the Maximum Path Sum between Any Two Leaves Medium % 0 63 Print Right View of Binary Tree Medium % 0 62 In a Binary Tree, Check if Two nodes has the same parent or are siblings Medium % 0 61 Determine If Two Nodes are Cousins Medium % 0 59 Print All Root-to-Leaf Paths in a Binary Tree Medium % 0 54 Maximum Width of a Binary Tree Medium % 0 48 Determining Whether a Given Binary Tree is a Binary Search Tree (BST) Medium % 1 41 Sorted Array to Binary Search Tree of Minimal Height Medium % 1 40 In a Binary Tree, Create Linked Lists of all the nodes at each depth Hard % 0 38 Determining Binary Tree Balance Medium % 0 36 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 Locate the Farthest Left Node on the Bottom Level Diameter Of a Binary Tree Find and Print Full Nodes in a Binary Tree Construct Binary Search Tree from a given Preorder Traversal using Recursion Convert Sorted Singly Linked List to Balanced Binary Search Tree Transforming a Binary Tree into its Mirror Image Given a binary tree, Find the Maximum Path Sum between Any Two Leaves Print Right View of Binary Tree In a Binary Tree, Check if Two nodes has the same parent or are siblings Determine If Two Nodes are Cousins Print All Root-to-Leaf Paths in a Binary Tree Maximum Width of a Binary Tree Determining Whether a Given Binary Tree is a Binary Search Tree (BST) Sorted Array to Binary Search Tree of Minimal Height In a Binary Tree, Create Linked Lists of all the nodes at each depth Determining Binary Tree Balance Find the Maximum Depth OR Height of a Binary Tree 1
