# Status Problem video Level Completes Likes 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 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 68 Transforming a Binary Tree into its Mirror Image Beginner % 0 67 Printing Nodes without Siblings in a Binary Tree Beginner % 0 64 Print Left 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 60 Determine if Two BSTs are Identical Beginner % 0 59 Print All Root-to-Leaf Paths in a Binary Tree Medium % 0 40 In a Binary Tree, Create Linked Lists of all the nodes at each depth Hard % 0 39 Level Order Traversal, Print each level in separate line Medium % 0 38 Determining Binary Tree Balance Medium % 0 36 Find the Maximum Depth OR Height of a Binary Tree Beginner % 1 32 Binary Search Tree (BST) Complete Implementation. Beginner % 0 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 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 Transforming a Binary Tree into its Mirror Image Printing Nodes without Siblings in a Binary Tree Print Left 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 Determine if Two BSTs are Identical Print All Root-to-Leaf Paths in a Binary Tree In a Binary Tree, Create Linked Lists of all the nodes at each depth Level Order Traversal, Print each level in separate line Determining Binary Tree Balance Find the Maximum Depth OR Height of a Binary Tree Binary Search Tree (BST) Complete Implementation. 1 2
