Tag: tree
- Add One Row to Tree
- All Elements in Two Binary Search Trees
- Average of Levels in Binary Tree
- Balanced Binary Tree
- Binary Search Tree to Greater Sum Tree
- Binary Tree Coloring Game
- Binary Tree Level Order Traversal II
- Binary Tree Level Order Traversal
- Binary Tree Pruning
- Binary Tree Right Side View
- Binary Tree Tilt
- Binary Tree Zigzag Level Order Traversal
- Check Completeness of a Binary Tree
- Complete Binary Tree Inserter
- Convert BST to Greater Tree
- Count Good Nodes in Binary Tree
- Count Nodes Equal to Average of Subtree
- Count the Number of Good Nodes
- Cousins in Binary Tree
- Deepest Leaves Sum
- Delete Leaves With a Given Value
- Delete Node in a BST
- Diameter of Binary Tree
- Distribute Coins in Binary Tree
- Evaluate Boolean Binary Tree
- Even Odd Tree
- Find a Corresponding Node of a Binary Tree in a Clone of That Tree
- Find Bottom Left Tree Value
- Find Largest Value in Each Tree Row
- Find Minimum Diameter After Merging Two Trees
- Find Mode in Binary Search Tree
- Flip Binary Tree To Match Preorder Traversal
- Flip Equivalent Binary Trees
- Frog Position After T Seconds
- Insert into a Binary Search Tree
- Insufficient Nodes in Root to Leaf Paths
- Invert Binary Tree
- K-th Largest Perfect Subtree Size in Binary Tree
- Kth Largest Element in a Stream
- Kth Largest Sum in a Binary Tree
- Kth Smallest Element in a BST
- Leaf-Similar Trees
- Longest Univalue Path
- Lowest Common Ancestor of a Binary Search Tree
- Lowest Common Ancestor of a Binary Tree
- Maximize the Number of Target Nodes After Connecting Trees I
- Maximize the Number of Target Nodes After Connecting Trees II
- Maximum Binary Tree II
- 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 Product of Splitted Binary Tree
- Maximum Width of Binary Tree
- Merge Two Binary Trees
- Minimum Absolute Difference in BST
- Minimum Depth of Binary Tree
- Minimum Distance Between BST Nodes
- Minimum Fuel Cost to Report to the Capital
- Minimum Number of Operations to Sort a Binary Tree by Level
- N-ary Tree Level Order Traversal
- Number of Good Leaf Nodes Pairs
- Number Of Ways To Reconstruct A Tree
- Path Sum III
- Path Sum
- Print Binary Tree
- Range Sum of BST
- 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
- Subtree of Another Tree
- Sum of Left Leaves
- Sum of Root To Leaf Binary Numbers
- Sum Root to Leaf Numbers
- Symmetric Tree
- Time Needed to Inform All Employees
- Trim a Binary Search Tree
- Univalued Binary Tree
- Validate Binary Search Tree
- Validate Binary Tree Nodes