# Status Problem video Level Completes Likes 142 Locate the Farthest Left Node on the Bottom Level Medium % 0 138 Find the Maximum Value in a Binary Tree Beginner % 0 137 Populate Next Right Pointers in Each Node Hard % 0 136 Verifying Mirror Binary Trees Beginner % 1 135 Find Paths with Sum in Binary Tree Medium % 0 134 Diameter Of a Binary Tree Hard % 1 132 Find the Deepest Node in a Binary Tree Medium % 1 130 Find and Print Full Nodes in a Binary Tree Beginner % 0 129 Binary Min-Max Heap Implementation Hard % 0 104 Print the Bottom View of a Binary Tree Medium % 0 100 AVL Tree - Insertion Hard % 0 99 Construct a binary tree from given Inorder and Level Order Traversal Hard % 0 98 Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Hard % 0 97 Construct Binary Search Tree from a given Preorder Traversal using Recursion Hard % 0 96 Print The Top View of a Binary Tree Medium % 0 95 Construct a Binary Tree from Given Inorder and Depth-First-Search Hard % 0 94 Depth First Search/Traversal in Binary Tree Beginner % 0 93 Inorder Predecessor and Successor in Binary Search Tree Hard % 0 81 Find Nodes X Levels Up from Leaf Nodes in a Tree Medium % 0 80 Find Nodes at Distance X from Root in a Tree Medium % 0 Locate the Farthest Left Node on the Bottom Level Find the Maximum Value in a Binary Tree Populate Next Right Pointers in Each Node Verifying Mirror Binary Trees Find Paths with Sum in Binary Tree Diameter Of a Binary Tree Find the Deepest Node in a Binary Tree Find and Print Full Nodes in a Binary Tree Binary Min-Max Heap Implementation Print the Bottom View of a Binary Tree AVL Tree - Insertion Construct a binary tree from given Inorder and Level Order Traversal Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Construct Binary Search Tree from a given Preorder Traversal using Recursion Print The Top View of a Binary Tree Construct a Binary Tree from Given Inorder and Depth-First-Search Depth First Search/Traversal in Binary Tree Inorder Predecessor and Successor in Binary Search Tree Find Nodes X Levels Up from Leaf Nodes in a Tree Find Nodes at Distance X from Root in a Tree 1 2 3 4
