# Status Problem video Level Completes Likes 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 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 63 Print Right 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 55 Print Nodes Between Two Levels in Binary Tree Medium % 0 54 Maximum Width of a Binary Tree Medium % 0 51 Print Binary Tree Nodes in Zigzag Order: Spiral Traversal Pattern Hard % 0 48 Determining Whether a Given Binary Tree is a Binary Search Tree (BST) Medium % 1 47 Find the Size of the Binary Tree Beginner % 0 46 Check if One Binary Tree is a Subtree of Another Medium % 0 45 Print a path from Root to Node in Binary Tree Medium % 0 44 Inorder Successor in Binary Tree Medium % 0 43 Inorder Successor in Binary Search Tree without Using Parent link Hard % 0 42 Inorder Successor in Binary Search Tree Using Parent link Hard % 0 41 Sorted Array to Binary Search Tree of Minimal Height Medium % 1 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 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 Print Right 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 Print Nodes Between Two Levels in Binary Tree Maximum Width of a Binary Tree Print Binary Tree Nodes in Zigzag Order: Spiral Traversal Pattern Determining Whether a Given Binary Tree is a Binary Search Tree (BST) Find the Size of the Binary Tree 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
