Is It a Single Chain
You are given the root of a binary tree. Return True if the tree is a single chain: every node has at most one child, so the tree never branches. It may bend left and right along the way. An empty tree and a single node count as chains.
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,null,2,3]
returns true
1 -> 2 -> 3, bending left at 2: still a chain.
Example 2
root [1,2,3]
returns false
The root branches into two.
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
- 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
- Sum of All Node ValuesBeginner
- Total Nodes in a Binary TreeBeginner
- Univalued Binary TreeBeginner