Problems # Status Problem Level Completes Likes 36 Inorder Predecessor and Successor in Binary Search Tree Hard % 0 37 Print All The Nodes Which are X distance from the Leaf Nodes Medium % 0 38 Print All The Nodes Which are X distance from the Root Medium % 0 39 Find the Distance between Two Nodes of a Binary Tree. Hard % 0 40 Find The Distance From Root To Given Node of a Binary Tree. Medium % 0 41 Construct a binary tree from given Inorder and Postorder Traversal Hard % 0 42 Print the Vertical Sum in binary Tree . Medium % 0 43 Print the Binary Tree in Vertical Order Path. Medium % 0 44 Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). Hard % 0 45 Lowest Common Ancestor in a Binary Search Tree. Medium % 0 46 Make a Binary Tree from Given Inorder and Preorder Traveral. Hard % 0 47 Given a binary tree, find out the maximum sum of value from root to each leaf. Medium % 0 48 Reverse Alternate levels of a given Binary Tree. Medium % 0 49 Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree. Medium % 0 50 Given a binary tree, Convert it into its Mirror Tree Beginner % 0 51 Given a binary tree, Print All the Nodes that don't have Siblings. Beginner % 0 52 Convert a Sorted Doubly Linked List to Balanced BST. Medium % 0 53 Given a binary tree, Find the Maximum Path Sum between Any Two Leaves Medium % 0 54 Print Left View of a given binary tree Medium % 0 55 Print Right View of a given binary tree Medium % 0 56 In a Binary Tree, Check if Two nodes has the same parent or are siblings Medium % 0 57 In a Binary Tree, Check if two nodes are Cousins Medium % 0 58 Check if Two BST's are Identical Beginner % 1 59 Print Paths from root to all leaf nodes in a binary tree. Medium % 0 60 Print All Nodes Between Two Given Levels Medium % 0 61 Find the maximum width of a binary tree Medium % 0 62 Level Order Traversal in Zig Zag pattern OR Print in Spiral Pattern Hard % 0 63 Determine whether given binary tree is binary search tree(BST) or not Medium % 0 64 Find the Size of the Binary Tree Beginner % 0 65 Given two binary trees, check if one binary tree is a subtree of another Medium % 1 66 Print a path from Root to Node in Binary Tree Medium % 0 67 Inorder Successor in Binary Tree Medium % 0 68 Inorder Successor in Binary Search Tree without Using Parent link Hard % 0 69 Inorder Successor in Binary Search Tree Using Parent link Hard % 0 70 Sorted Array to Binary Search Tree of Minimal Height Medium % 0 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. 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 a given binary tree Print Right 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. Print All Nodes Between Two Given Levels Find the maximum width of a binary tree Level Order Traversal in Zig Zag pattern OR Print in Spiral Pattern Determine whether given binary tree is binary search tree(BST) or not Find the Size of the Binary Tree Given two binary trees, check if one binary tree is a subtree of another Print a path from Root to Node in Binary Tree Inorder Successor in Binary Tree Inorder Successor in Binary Search Tree without Using Parent link Inorder Successor in Binary Search Tree Using Parent link Sorted Array to Binary Search Tree of Minimal Height 1 2 3
