Total Nodes in a Binary Tree
You are given the root of a binary tree. Return how many nodes the tree has. An empty tree has 0.
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,6]
returns 6
Six nodes.
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.