Trees
Binary trees: depth-first and level-by-level walks, and what a search tree promises.
| Status | Challenge | Topics | Level | Accepted | Save |
|---|---|---|---|---|---|
| 1.Depth of a TreeCount the levels of a binary tree, from the root to its deepest leaf. | TreesRecursion | Easy | – | ||
| 2.Invert a TreeMirror a binary tree, swapping every node's left and right children. | TreesRecursion | Easy | – | ||
| 3.Tree Level by LevelList a binary tree's values one level at a time, left to right. | TreesGraphs | Medium | – | ||
| 4.Valid Search TreeCheck whether a binary tree keeps the search tree order everywhere. | TreesRecursion | Medium | – | ||
| 5.Best Path Sum in a TreeFind the path through a binary tree whose values add up to the most. | TreesRecursionDynamic programming | Hard | – |