Write a function to iteratively determine the total number of "full nodes" in a binary tree.
A full node contains left and right child nodes.
If there are no full nodes, return

`0`

.
Example: 1 / \ 2 3 / \ / \ 4 5 6 7 / \ 8 9 Full nodes count ==> 4

Need a **hand?** Try out these hints, one at a time.

This problem is straightforward to solve with recursion. To solve it with iteration instead, you could use a

`Queue`

to traverse the tree.
1. Initialize a `Queue`

to store the nodes of the tree.

2. Add the `root`

node to the Queue.

3. `Loop`

until the `Queue`

becomes empty.

4. Within the loop, remove the node from the `Queue`

and check if it has both its children.

5. If yes, increment the `count`

, which stores the total number of full nodes.

6. Enqueue the children of the above node.

7. At the end of the `loop`

, return the `count`

.

public int numberOfFullNodes(TreeNode root) { }

**C**

**Java**

**Python**