Collect the Leaves
You are given the root of a binary tree. A leaf is a node with no children. Return the values of all leaves from left to right. An empty tree gives []; a tree with only a root gives that root's value in a list.
Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.
Example 1
root [1,2,3,4,5]
returns [4,5,3]
The leaves are 4, 5 and 3, from left to right.
Constraints
0 <= number of nodes <= 100-100 <= node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Trees problems
- Count the LeavesBeginner
- Full Binary Tree CheckBeginner
- Is It a Single ChainBeginner
- Nodes With Exactly One ChildBeginner
- Replace Values With DepthBeginner
- Search Path in a BSTBeginner
- Search in a Binary Search TreeBeginner
- Smallest and Largest in a BSTBeginner