Trees
Next Greater Number BSTBalanced Binary TreeSame TreeSymmetric TreeInorder Traversal of Cartesian TreeConvert Sorted Array to Binary Search TreeConstruct Binary Tree from Inorder and Postorder TraversalConstruct Binary Tree from Preorder and Inorder TraversalInvert Binary TreeKth Smallest Element in a BSTTwo Sum IVBinary Search Tree IteratorRecover Binary Search TreeBinary Tree Inorder TraversalBinary Tree Postorder TraversalBinary Tree Preorder TraversalBinary Tree Zigzag Level Order TraversalPopulating Next Right Pointers in Each NodePopulating Next Right Pointers in Each Node IIPath SumPath Sum IIPath Sum IIISum Root to Leaf NumbersSmallest String Starting From LeafConstruct Binary Search Tree from Preorder TraversalConstruct BST from PostorderConvert Level Order Traversal to BSTMaximum Depth of Binary TreeMinimum Depth of Binary TreeBinary Tree Level Order TraversalDiagonal TraversalVertical Order Traversal of a Binary TreeBinary Tree Right Side ViewLeft View of Binary TreeBoundary Traversal of binary treeConstruct Binary Tree from Parent ArrayMaximum Binary Tree IIDelete Leaves With a Given ValueMost Frequent Subtree SumFlatten Binary Tree to Linked ListLeast Common AncestorMaximum width of a binary treeMaximum Width of Binary TreeBinary Tree PruningFind Bottom Left Tree ValueMaximum Product of Splitted Binary TreeRecover a Tree From Preorder TraversalReverse alternate levels of a perfect binary treeFind Largest Value in Each Tree RowShortest Unique PrefixImplement Trie (Prefix Tree)Foldable Binary TreesConvert a given tree to its Sum TreePerfect Binary Tree Specific Level Order TraversalChange a Binary Tree so that every node stores sum of all nodes in left subtreeConvert a given Binary Tree to Doubly Linked ListBinary Tree to a Circular Doubly Link ListMaximum edge removal from tree to make even forestPrint common nodes on path from root (or common ancestors)Minimum Distance Between BST NodesFind distance between two nodes of a Binary TreePopulate Inorder Successor for all nodesDouble TreeBinary Tree Maximum Path SumMaximum Path SumPrint all nodes at distance k from a given nodeBinary Trees Custom TreeTilt of Binary TreeConstruct a special tree from given preorder traversalSum of k smallest elements in BSTCheck whether BST contains Dead End or notBinary Tree to Binary Search Tree ConversionRemove nodes on root to leaf paths of length < KFind Height of Binary Tree represented by Parent arrayVertical Sum in Binary TreeExtract Leaves of a Binary Tree in a Doubly Linked ListLongest ZigZag Path in a Binary TreeValidate Binary Search TreeMaximum Level Sum of a Binary TreeConvert Sorted List to Binary Search TreeMerge Two Binary TreesDiameter of Binary TreeCount Good Nodes in Binary TreeSerialize and Deserialize Binary TreeReplace WordsValidate Binary Tree NodesAdd One Row to TreeInsufficient Nodes in Root to Leaf PathsPseudo-Palindromic Paths in a Binary TreeFind Duplicate SubtreesInorder Successor in BSTDistribute Coins in Binary TreeDelete Node in a BSTCount Complete Tree NodesBinary Tree Coloring GameDelete Nodes And Return ForestSum of Nodes with Even-Valued GrandparentDeepest Leaves SumCousins in Binary TreeBinary Search Tree to Greater Sum TreeStream of CharactersClosest Leaf in a Binary TreeBinary Tree CamerasLowest Common Ancestor of a Binary Search TreeBalance a Binary Search TreeMaximum Sum BST in Binary TreeKth Ancestor of a Tree NodeBinary Tree Upside DownLinked List in Binary TreeLCA in a tree using Binary Lifting TechniqueNumber of Nodes in the Sub-Tree With the Same LabelNumber of Good Leaf Nodes Pairs
Last updated