Binary Tree | LeetCode Problems

115 Binary Tree solutions to LeetCode solutions.

View Source Code on GitHub

All 1710 Array 950 String 431 Hash Table 337 Math 313 Dynamic Programming 307 Sorting 226 Greedy 195 Depth-First Search 186 Binary Search 150 Breadth-First Search 150 Matrix 141 Tree 137 Two Pointers 134 Bit Manipulation 127 Binary Tree 115 Stack 108 Heap Priority Queue 92 Prefix Sum 91 Simulation 80 Backtracking 75 Design 74 Counting 73 Graph 72 Sliding Window 70 Linked List 54 Union Find 51 Divide and Conquer 37 Monotonic Stack 36 Recursion 34 Ordered Set 32 Enumeration 30 Trie 30 Bitmask 30 Memoization 30 Binary Search Tree 28 Number Theory 27 Queue 26 Geometry 23 Segment Tree 21 Game Theory 21 Combinatorics 19 Topological Sort 18 Hash Function 16 String Matching 15 Binary Indexed Tree 14 Randomized 12 Shortest Path 11 Rolling Hash 11 Data Stream 10 Monotonic Queue 10 Brainteaser 9 Merge Sort 8 Counting Sort 8 Doubly-Linked List 6 Probability and Statistics 6 Quickselect 6 Bucket Sort 6 Interactive 5 Iterator 5 Line Sweep 5 Reservoir Sampling 4 Suffix Array 3 Minimum Spanning Tree 2 Strongly Connected Component 2 Eulerian Circuit 2 Radix Sort 2 Rejection Sampling 2 Biconnected Component 1

Binary Tree Problems View all solutions →

Binary Tree Inorder Traversal

Unique Binary Search Trees II

Unique Binary Search Trees

Validate Binary Search Tree

Recover Binary Search Tree

Same Tree

Symmetric Tree

Binary Tree Level Order Traversal

Binary Tree Zigzag Level Order Traversal

Maximum Depth of Binary Tree

Construct Binary Tree from Preorder and Inorder Traversal

Construct Binary Tree from Inorder and Postorder Traversal

Binary Tree Level Order Traversal II

Convert Sorted Array to Binary Search Tree

Convert Sorted List to Binary Search Tree

Balanced Binary Tree

Minimum Depth of Binary Tree

Path Sum

Path Sum II

Flatten Binary Tree to Linked List

Populating Next Right Pointers in Each Node

Populating Next Right Pointers in Each Node II

Binary Tree Maximum Path Sum

Sum Root to Leaf Numbers

Binary Tree Preorder Traversal

Binary Tree Postorder Traversal

Binary Search Tree Iterator

Binary Tree Right Side View

Count Complete Tree Nodes

Invert Binary Tree

Kth Smallest Element in a BST

Lowest Common Ancestor of a Binary Search Tree

Lowest Common Ancestor of a Binary Tree

Binary Tree Paths

Serialize and Deserialize Binary Tree

Verify Preorder Serialization of a Binary Tree

House Robber III

Sum of Left Leaves

Path Sum III

Serialize and Deserialize BST

Delete Node in a BST

Find Mode in Binary Search Tree

Most Frequent Subtree Sum

Find Bottom Left Tree Value

Find Largest Value in Each Tree Row

Minimum Absolute Difference in BST

Convert BST to Greater Tree

Diameter of Binary Tree

Binary Tree Tilt

Subtree of Another Tree

Construct String from Binary Tree

Merge Two Binary Trees

Add One Row to Tree

Average of Levels in Binary Tree

Find Duplicate Subtrees

Two Sum IV - Input is a BST

Maximum Binary Tree

Print Binary Tree

Maximum Width of Binary Tree

Trim a Binary Search Tree

Second Minimum Node In a Binary Tree

Longest Univalue Path

Search in a Binary Search Tree

Insert into a Binary Search Tree

Kth Largest Element in a Stream

Minimum Distance Between BST Nodes

Binary Tree Pruning

All Nodes Distance K in Binary Tree

Smallest Subtree with all the Deepest Nodes

Leaf-Similar Trees

Construct Binary Tree from Preorder and Postorder Traversal

All Possible Full Binary Trees

Increasing Order Search Tree

Complete Binary Tree Inserter

Range Sum of BST

Flip Equivalent Binary Trees

Check Completeness of a Binary Tree

Univalued Binary Tree

Binary Tree Cameras

Flip Binary Tree To Match Preorder Traversal

Distribute Coins in Binary Tree

Vertical Order Traversal of a Binary Tree

Smallest String Starting From Leaf

Cousins in Binary Tree

Maximum Binary Tree II

Construct Binary Search Tree from Preorder Traversal

Sum of Root To Leaf Binary Numbers

Maximum Difference Between Node and Ancestor

Recover a Tree From Preorder Traversal

Binary Search Tree to Greater Sum Tree

Insufficient Nodes in Root to Leaf Paths

Path In Zigzag Labelled Binary Tree

Delete Nodes And Return Forest

Lowest Common Ancestor of Deepest Leaves

Binary Tree Coloring Game

Maximum Level Sum of a Binary Tree

Find Elements in a Contaminated Binary Tree

Deepest Leaves Sum

All Elements in Two Binary Search Trees

Sum of Nodes with Even-Valued Grandparent

Delete Leaves With a Given Value

Maximum Product of Splitted Binary Tree

Validate Binary Tree Nodes

Linked List in Binary Tree

Longest ZigZag Path in a Binary Tree

Maximum Sum BST in Binary Tree

Find a Corresponding Node of a Binary Tree in a Clone of That Tree

Balance a Binary Search Tree

Count Good Nodes in Binary Tree

Pseudo-Palindromic Paths in a Binary Tree

Number of Good Leaf Nodes Pairs

Number of Ways to Reorder Array to Get Same BST

Even Odd Tree

Merge BSTs to Create Single BST

Count Nodes With the Highest Score