Given the root of a binary tree, return the total number of nodes in it. The tree is given as a level-order array with null for missing children.
Input: A level-order array of the tree.
Output: Integer — the node count.
Input: [1,2,3,4,5,null,6]
Output: 6
Explanation: Six nodes total.Input: [1]
Output: 1
Explanation: Single node.Input: []
Output: 0
Explanation: Empty tree.0<=nodes<=10^4-1000<=value<=1000