# Status Problem video Level Completes Likes 132 Find the Deepest Node in a Binary Tree Medium % 1 131 Find the Height of a tree without using Recursion Medium % 0 130 Find and Print Full Nodes in a Binary Tree Beginner % 0 116 Generate All Balanced Parentheses Combinations (N Pairs) Medium % 1 113 Towers Of Hanoi Beginner % 0 112 Generate All n-Bit Binary Strings Medium % 1 109 Find Greatest Common Divisor (GCD) Efficiently with Euclidean Algorithm Beginner % 0 104 Print the Bottom View of a Binary Tree Medium % 0 102 Merge Sort for Linked Lists (In-place Algorithm) 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 82 Find Nodes at Distance X from a Given Node in a 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 79 Calculate Distance Between Nodes in a Binary Tree Hard % 0 78 Root-to-Node Distance in Binary Tree: How to Find Medium % 0 77 Construct a binary tree from given Inorder and Postorder Traversal Hard % 0 76 Calculate Vertical Sum in Binary Tree Medium % 0 75 Print the Binary Tree in Vertical Order Path Medium % 0 74 Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). Hard % 0 73 Lowest Common Ancestor in a Binary Search Tree. Medium % 0 72 Make a Binary Tree from Given Inorder and Preorder Traversal Hard % 0 71 Given a binary tree, find out the maximum sum of value from root to each leaf Medium % 0 70 Reversing Alternate Levels in a Binary Tree Medium % 0 69 Convert Sorted Singly Linked List to Balanced Binary Search Tree Medium % 1 67 Printing Nodes without Siblings in a Binary Tree Beginner % 0 66 Convert a Sorted Doubly Linked List to Balanced BST Medium % 1 65 Given a binary tree, Find the Maximum Path Sum between Any Two Leaves Medium % 0 64 Print Left View of binary tree Medium % 0 Find the Deepest Node in a Binary Tree Find the Height of a tree without using Recursion Find and Print Full Nodes in a Binary Tree Generate All Balanced Parentheses Combinations (N Pairs) Towers Of Hanoi Generate All n-Bit Binary Strings Find Greatest Common Divisor (GCD) Efficiently with Euclidean Algorithm Print the Bottom View of a Binary Tree Merge Sort for Linked Lists (In-place Algorithm) 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 at Distance X from a Given Node in a Tree Find Nodes X Levels Up from Leaf Nodes in a Tree Find Nodes at Distance X from Root in a Tree Calculate Distance Between Nodes in a Binary Tree Root-to-Node Distance in Binary Tree: How to Find Construct a binary tree from given Inorder and Postorder Traversal Calculate Vertical Sum in Binary Tree Print the Binary Tree in Vertical Order Path Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). Lowest Common Ancestor in a Binary Search Tree. Make a Binary Tree from Given Inorder and Preorder Traversal Given a binary tree, find out the maximum sum of value from root to each leaf Reversing Alternate Levels in a Binary Tree Convert Sorted Singly Linked List to Balanced Binary Search Tree Printing Nodes without Siblings in a Binary Tree Convert a Sorted Doubly Linked List to Balanced BST Given a binary tree, Find the Maximum Path Sum between Any Two Leaves Print Left View of binary tree 1 2 3 4 5
