Tag: tree
- Add One Row to Tree
- All Elements in Two Binary Search Trees
- All Nodes Distance K in Binary Tree
- All Possible Full Binary Trees
- Amount of Time for Binary Tree to Be Infected
- Average of Levels in Binary Tree
- Balance a Binary Search Tree
- Balanced Binary Tree
- Binary Search Tree Iterator II
- Binary Search Tree Iterator
- Binary Search Tree to Greater Sum Tree
- Binary Tree Cameras
- Binary Tree Coloring Game
- Binary Tree Inorder Traversal
- Binary Tree Level Order Traversal II
- Binary Tree Level Order Traversal
- Binary Tree Longest Consecutive Sequence II
- Binary Tree Longest Consecutive Sequence
- Binary Tree Maximum Path Sum
- Binary Tree Paths
- Binary Tree Postorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Pruning
- Binary Tree Right Side View
- Binary Tree Tilt
- Binary Tree Upside Down
- Binary Tree Vertical Order Traversal
- Binary Tree Zigzag Level Order Traversal
- Boundary of Binary Tree
- Build Binary Expression Tree From Infix Expression
- Change the Root of a Binary Tree
- Check Completeness of a Binary Tree
- Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
- Check if DFS Strings Are Palindromes
- Check If Two Expression Trees are Equivalent
- Choose Edges to Maximize Score in a Tree
- Clone Binary Tree With Random Pointer
- Clone N-ary Tree
- Closest Binary Search Tree Value II
- Closest Binary Search Tree Value
- Closest Leaf in a Binary Tree
- Closest Node to Path in Tree
- Closest Nodes Queries in a Binary Search Tree
- Collect Coins in a Tree
- Complete Binary Tree Inserter
- Construct Binary Search Tree from Preorder Traversal
- Construct Binary Tree from Inorder and Postorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- Construct Binary Tree from Preorder and Postorder Traversal
- Construct Binary Tree from String
- Construct Quad Tree
- Construct String from Binary Tree
- Convert Binary Search Tree to Sorted Doubly Linked List
- Convert BST to Greater Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Correct a Binary Tree
- Count Complete Tree Nodes
- Count Good Nodes in Binary Tree
- Count Nodes Equal to Average of Subtree
- Count Nodes Equal to Sum of Descendants
- Count Nodes That Are Great Enough
- Count Nodes With the Highest Score
- Count Number of Possible Root Nodes
- Count Pairs of Connectable Servers in a Weighted Tree Network
- Count Paths That Can Form a Palindrome in a Tree
- Count Subtrees With Max Distance Between Cities
- Count the Number of Good Nodes
- Count Univalue Subtrees
- Count Valid Paths in a Tree
- Count Ways to Build Rooms in an Ant Colony
- Cousins in Binary Tree II
- Cousins in Binary Tree
- Create Binary Tree From Descriptions
- Create Components With Same Value
- Cycle Length Queries in a Tree
- Deepest Leaves Sum
- Delete Leaves With a Given Value
- Delete Node in a BST
- Delete Nodes And Return Forest
- Delete Tree Nodes
- Depth of BST Given Insertion Order
- Design an Expression Tree With Evaluate Function
- Diameter of Binary Tree
- Diameter of N-Ary Tree
- Difference Between Maximum and Minimum Price Sum
- Distribute Coins in Binary Tree
- Employee Importance
- Encode N-ary Tree to Binary Tree
- Equal Tree Partition
- Evaluate Boolean Binary Tree
- Even Odd Tree
- Extract Kth Character From The Rope Tree
- Find a Corresponding Node of a Binary Tree in a Clone of That Tree
- Find All The Lonely Nodes
- Find Bottom Left Tree Value
- Find Distance in a Binary Tree
- Find Duplicate Subtrees
- Find Elements in a Contaminated Binary Tree
- Find Largest Value in Each Tree Row
- Find Leaves of Binary Tree
- Find Minimum Diameter After Merging Two Trees
- Find Mode in Binary Search Tree
- Find Nearest Right Node in Binary Tree
- Find Number of Coins to Place in Tree Nodes
- Find Root of N-Ary Tree
- Find Subtree Sizes After Changes
- Find the Last Marked Nodes in Tree
- Find the Level of Tree with Minimum Sum
- Find the Maximum Sum of Node Values
- Flatten Binary Tree to Linked List
- Flatten Nested List Iterator
- Flip Binary Tree To Match Preorder Traversal
- Flip Equivalent Binary Trees
- Frog Position After T Seconds
- Height of Binary Tree After Subtree Removal Queries
- Height of Special Binary Tree
- House Robber III
- Increasing Order Search Tree
- Inorder Successor in BST II
- Inorder Successor in BST
- Insert into a Binary Search Tree
- Insufficient Nodes in Root to Leaf Paths
- Invert Binary Tree
- Is Array a Preorder of Some Binary Tree
- K-th Largest Perfect Subtree Size in Binary Tree
- Kill Process
- Kth Ancestor of a Tree Node
- Kth Largest Element in a Stream
- Kth Largest Sum in a Binary Tree
- Kth Smallest Element in a BST
- Largest BST Subtree
- Leaf-Similar Trees
- Linked List in Binary Tree
- Logical OR of Two Binary Grids Represented as Quad-Trees
- Longest Path With Different Adjacent Characters
- Longest Special Path II
- Longest Special Path
- Longest Univalue Path
- Longest ZigZag Path in a Binary Tree
- Lowest Common Ancestor of a Binary Search Tree
- Lowest Common Ancestor of a Binary Tree II
- Lowest Common Ancestor of a Binary Tree III
- Lowest Common Ancestor of a Binary Tree IV
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of Deepest Leaves
- Make Costs of Paths Equal in a Binary Tree
- Maximize Sum of Weights after Edge Removals
- Maximize the Number of Target Nodes After Connecting Trees I
- Maximize the Number of Target Nodes After Connecting Trees II
- Maximum Average Subtree
- Maximum Binary Tree II
- Maximum Binary Tree
- Maximum Depth of Binary Tree
- Maximum Depth of N-ary Tree
- Maximum Difference Between Node and Ancestor
- Maximum Level Sum of a Binary Tree
- Maximum Number of K-Divisible Components
- Maximum Points After Collecting Coins From All Nodes
- Maximum Product of Splitted Binary Tree
- Maximum Score After Applying Operations on a Tree
- Maximum Subtree of the Same Color
- Maximum Sum BST in Binary Tree
- Maximum Width of Binary Tree
- Maximum XOR of Two Non-Overlapping Subtrees
- Merge BSTs to Create Single BST
- Merge Two Binary Trees
- Minimize the Total Price of the Trips
- Minimum Absolute Difference in BST
- Minimum Depth of Binary Tree
- Minimum Distance Between BST Nodes
- Minimum Edge Weight Equilibrium Queries in a Tree
- Minimum Flips in Binary Tree to Get Result
- Minimum Fuel Cost to Report to the Capital
- Minimum Number of Operations to Sort a Binary Tree by Level
- Minimum Score After Removals on a Tree
- Minimum Time to Collect All Apples in a Tree
- Most Frequent Subtree Sum
- Most Profitable Path in a Tree
- Move Sub-Tree of N-Ary Tree
- N-ary Tree Level Order Traversal
- N-ary Tree Postorder Traversal
- N-ary Tree Preorder Traversal
- Number of Good Leaf Nodes Pairs
- Number of Good Paths
- Number of Nodes in the Sub-Tree With the Same Label
- Number of Nodes With Value One
- Number Of Ways To Reconstruct A Tree
- Number of Ways to Reorder Array to Get Same BST
- Operations on Tree
- Path In Zigzag Labelled Binary Tree
- Path Sum II
- Path Sum III
- Path Sum IV
- Path Sum
- Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node
- Print Binary Tree
- Pseudo-Palindromic Paths in a Binary Tree
- Range Sum of BST
- Reachable Nodes With Restrictions
- Recover a Tree From Preorder Traversal
- Recover Binary Search Tree
- Reverse Odd Levels of Binary Tree
- Root Equals Sum of Children
- Same Tree
- Search in a Binary Search Tree
- Second Minimum Node In a Binary Tree
- Serialize and Deserialize Binary Tree
- Serialize and Deserialize BST
- Serialize and Deserialize N-ary Tree
- Smallest Common Region
- Smallest Missing Genetic Value in Each Subtree
- Smallest String Starting From Leaf
- Smallest Subtree with all the Deepest Nodes
- Split BST
- Step-By-Step Directions From a Binary Tree Node to Another
- Subtree of Another Tree
- Subtree Removal Game with Fibonacci Tree
- Sum of Distances in Tree
- Sum of Left Leaves
- Sum of Nodes with Even-Valued Grandparent
- Sum of Root To Leaf Binary Numbers
- Sum Root to Leaf Numbers
- Symmetric Tree
- Throne Inheritance
- Time Needed to Inform All Employees
- Time Taken to Mark All Nodes
- Tree Diameter
- Tree of Coprimes
- Trim a Binary Search Tree
- Two Sum BSTs
- Two Sum IV - Input is a BST
- Unique Binary Search Trees II
- Unique Binary Search Trees
- Univalued Binary Tree
- Validate Binary Search Tree
- Validate Binary Tree Nodes
- Verify Preorder Sequence in Binary Search Tree
- Verify Preorder Serialization of a Binary Tree
- Vertical Order Traversal of a Binary Tree