• Home
  • Learn
  • Feed
  • Ladder
  • Saved
← Roadmapsall trees problems
🌳

Trees

Traversals, depth, paths, BST, ancestors.

6 stops · 164 problems0/76 on the path done
next ▸ Inorder TraversalSilver · 1050
1

Traversals

0/16 of 32you are here

Inorder, preorder, postorder, level order.

○Inorder Traversal○Preorder Traversal○Serialize Tree to Level Order○Inorder Traversal Array○Preorder Traversal Array○Postorder Traversal○Binary Tree Inorder Traversal○Binary Tree Preorder Traversal○Postorder Traversal Array○Binary Tree Right Side View○Binary Tree Postorder Traversal○Flatten Tree to Linked List○Binary Tree Level Order Traversal○Level Order Array of Arrays○Zigzag Level Order Traversal○Kth Smallest in a BST+16 in the arena
2

Depth & shape

0/16 of 25

Max/min depth, balanced, symmetric, diameter.

○Count Nodes○Count Nodes in Binary Tree○Same Tree○Is Height-Balanced○Count Nodes in Range○All Elements in Two BSTs○Invert Binary Tree○Sorted List to Balanced BST○Invert Tree○Sorted Array to BST○Merge Two Binary Trees○Invert a Binary Tree○Is the Tree Height-Balanced?○Symmetric Tree○Balanced Binary Tree○Balance a BST (Return Height)+9 in the arena
3

Sums & paths

0/16 of 25

Path sum, root-to-leaf, left leaves, good nodes.

○Sum of Left Leaves○Count Leaves○Average of Levels○Deepest Leaves Sum○Has Root-to-Leaf Path Sum○Average of Levels in Binary Tree○Count Good Nodes○Sum Root to Leaf Numbers○Sum of Nodes○Average of Levels Array○Path Sum○Path Sum II○Path Sum Exists○Path Sum II Count○Path Sum Count○Path Sum III Count+9 in the arena
4

BST

0/6

Validate, range sum, kth smallest, LCA in BST.

○Increasing Order Traversal○Search BST○Kth Smallest Element in a BST○Increasing Order Search Tree○Validate BST○Kth Smallest in BST
5

Ancestors & misc

0/6

LCA, subtree, cameras, flatten.

○Lowest Common Ancestor in a BST○Lowest Common Ancestor in BST○Lowest Common Ancestor○Lowest Common Ancestor of a Binary Tree○Is Subtree○Binary Tree Cameras
6

More Trees

0/16 of 70

Everything else in this category — keep climbing.

○Maximum Depth of Binary Tree○Sum of All Values○Maximum Depth of a Binary Tree○Sum of All Node Values○Count Tree Nodes○Find Maximum Value○Search a BST○Range Sum of a BST○Largest Value in Each Row○Insert into a BST○Populate Next Right Pointers○Binary Tree Left Side View○Maximum Depth○Minimum Difference in a BST○Count Complete Tree Nodes○Closest Value in a BST+54 in the arena
🏁Finish line