FunctionRacerProblemsRace

Is It a Single Chain

BeginnerTreesPython, JavaScript, TypeScript, Java, C++

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

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Trees problems