Problems/Tree DFS

Tree DFS

Explore tree depth-first using recursion/stack — solve path sum, diameter, validation and serialization problems.

21Total

1Maximum Depth of Binary Tree

3Invert Binary Tree

5Diameter of Binary Tree

6Balanced Binary Tree

7Subtree of Another Tree

8Binary Tree Paths

10Sum Root to Leaf Numbers

11Lowest Common Ancestor of a BST

12Validate Binary Search Tree

13Kth Smallest Element in a BST

14Construct Binary Tree from Preorder and Inorder

15Binary Tree Maximum Path Sum

16Serialize and Deserialize Binary Tree

1Symmetric Tree

2Flatten Binary Tree to Linked List

3Binary Tree Inorder Traversal

4Maximum Average Subtree

5Count Univalue Subtrees

© 2026 FrontendX. All rights reserved.