130. Find and Print Full Nodes in a Binary Tree

Objective: Given a binary tree, print all nodes are full nodes.

Full Nodes: Nodes Which have both the children, left and right are called Full Nodes

Approach:

a quite simple solution.

Do any of the traversal (inorder, preorder, postorder, etc).
During traversal, check the node if it has a left child and a right child, If yes then print it

Output:

Full Nodes are 2 1