Problems # Status Problem Level Completes Likes 36 Construct a Binary Tree from Given Inorder and Depth-First-Search. Hard % 0 37 Depth First Search/Traversal in Binary Tree Beginner % 0 38 Inorder Predecessor and Successor in Binary Search Tree Hard % 0 39 Print All The Nodes Which are X distance from the Leaf Nodes Medium % 0 40 Print All The Nodes Which are X distance from the Root Medium % 0 41 Find the Distance between Two Nodes of a Binary Tree. Hard % 0 42 Find The Distance From Root To Given Node of a Binary Tree. Medium % 0 43 Construct a binary tree from given Inorder and Postorder Traversal Hard % 0 44 Print the Vertical Sum in binary Tree . Medium % 0 45 Print the Binary Tree in Vertical Order Path. Medium % 0 46 Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). Hard % 0 47 Lowest Common Ancestor in a Binary Search Tree. Medium % 0 48 Make a Binary Tree from Given Inorder and Preorder Traveral. Hard % 0 49 Given a binary tree, find out the maximum sum of value from root to each leaf. Medium % 0 50 Reverse Alternate levels of a given Binary Tree. Medium % 0 51 Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree. Medium % 0 52 Given a binary tree, Convert it into its Mirror Tree Beginner % 0 53 Given a binary tree, Print All the Nodes that don't have Siblings. Beginner % 0 54 Print Left View of a given binary tree Medium % 0 55 In a Binary Tree, Check if Two nodes has the same parent or are siblings Medium % 0 56 In a Binary Tree, Check if two nodes are Cousins Medium % 0 57 Check if Two BST's are Identical Beginner % 1 58 Print Paths from root to all leaf nodes in a binary tree. Medium % 0 59 In a Binary Tree, Create Linked Lists of all the nodes at each depth. Hard % 0 60 Find whether a Given Binary Tree is Balanced? Medium % 0 61 Find the Maximum Depth OR Height of a Binary Tree Beginner % 0 62 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 Print All The Nodes Which are X distance from the Leaf Nodes Print All The Nodes Which are X distance from the Root Find the Distance between Two Nodes of a Binary Tree. Find The Distance From Root To Given Node of a Binary Tree. Construct a binary tree from given Inorder and Postorder Traversal Print the 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 Traveral. Given a binary tree, find out the maximum sum of value from root to each leaf. Reverse Alternate levels of a given Binary Tree. 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, Print All the Nodes that don't have Siblings. Print Left 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 Check if Two BST's are Identical Print Paths from root to all leaf nodes in a binary tree. 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 Binary Search Tree (BST) Complete Implementation. 1 2
