•PRACTICE

DSA Question Tracker & Breakdowns

41 problems tagged Tree with full breakdowns.

433problems
32companies
39topics
3languages each
Tree✕Clear all
102.Binary Tree Level Order Traversal
Breadth-First SearchTree
Medium+4▶ Mock
98.Validate Binary Search Tree
Depth-First SearchBinary Search TreeTree
Medium+3▶ Mock
104.Maximum Depth of Binary Tree
Depth-First SearchBreadth-First SearchTree
Easy+4▶ Mock
226.Invert Binary Tree
Depth-First SearchBreadth-First SearchTree
Easy+1▶ Mock
100.Same Tree
Depth-First SearchBreadth-First SearchTree
Easy+2▶ Mock
101.Symmetric Tree
Depth-First SearchBreadth-First SearchTree
Easy+1▶ Mock
230.Kth Smallest Element in a BST
Depth-First SearchBinary Search TreeTree
Medium+2▶ Mock
297.Serialize and Deserialize Binary Tree
Depth-First SearchBreadth-First SearchTree
Hard+4▶ Mock
341.Flatten Nested List Iterator
StackTreeDepth-First Search
Medium▶ Mock
124.Binary Tree Maximum Path Sum
Dynamic ProgrammingTreeDepth-First Search
235.Lowest Common Ancestor of a Binary Search Tree
TreeDepth-First SearchBinary Search Tree
Medium▶ Mock
103.Binary Tree Zigzag Level Order Traversal
TreeBreadth-First SearchBinary Tree
Medium▶ Mock
2477.Minimum Fuel Cost to Report to the Capital
TreeDepth-First SearchBreadth-First Search
Medium▶ Mock
94.Binary Tree Inorder Traversal
StackTreeDepth-First Search
144.Binary Tree Preorder Traversal
StackTreeDepth-First Search
314.Binary Tree Vertical Order Traversal
Hash TableTreeDepth-First Search
Medium▶ Mock
427.Construct Quad Tree
ArrayDivide and ConquerTree
Medium▶ Mock
337.House Robber III
Dynamic ProgrammingTreeDepth-First Search
Medium▶ Mock
3367.Maximize Sum of Weights after Edge Removals
Dynamic ProgrammingTreeDepth-First Search
1644.Lowest Common Ancestor of a Binary Tree II
TreeDepth-First SearchBinary Tree
Medium▶ Mock
1676.Lowest Common Ancestor of a Binary Tree IV
Hash TableTreeDepth-First Search
Medium▶ Mock
428.Serialize and Deserialize N-ary Tree
StringTreeDepth-First Search
987.Vertical Order Traversal of a Binary Tree
Hash TableTreeDepth-First Search
Populating Next Right Pointers in Each Node
Linked ListTreeDepth-First Search
Medium+1▶ Mock
110.Balanced Binary Tree
TreeDepth-First SearchBinary Tree
199.Binary Tree Right Side View
TreeDepth-First SearchBreadth-First Search
Medium▶ Mock
257.Binary Tree Paths
StringBacktrackingTree
437.Path Sum III
TreeDepth-First SearchBinary Tree
Medium▶ Mock
543.Diameter of Binary Tree
TreeDepth-First SearchBinary Tree
701.Insert into a Binary Search Tree
TreeBinary Search TreeBinary Tree
Medium▶ Mock
968.Binary Tree Cameras
Dynamic ProgrammingTreeDepth-First Search
1145.Binary Tree Coloring Game
TreeDepth-First SearchBinary Tree
Medium▶ Mock
1600.Throne Inheritance
Hash TableTreeDepth-First Search
Medium▶ Mock
2265.Count Nodes Equal to Average of Subtree
TreeDepth-First SearchBinary Tree
Medium▶ Mock

Practice with a Mock Interview

Solve these problems under real interview pressure with our AI interviewer.

Start Mock Interview →