Count non-leaf nodes (left & right child) in binary tree (java/ non-recursive/example)
A node in a binary tree which has child node(s) is called non leaf node.
Non Leaf Node can be categorized as follows:
Non Leaf node having one child (Either left child or right child)
Non Leaf node having two children (Both left child and right child)