Full Binary Tree Check
You are given the root of a binary tree. A tree is full if every node has either 0 or 2 children (never exactly one). Return True if the tree is full, otherwise False. An empty tree and a single node are full.
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]
returns true
Root has two children, both leaves: full.
Example 2
root [1,2,3,4]
returns false
2 has only one child.
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
- 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
- Sum of All Node ValuesBeginner
- Total Nodes in a Binary TreeBeginner