Print All The Full Nodes in a Binary Tree

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

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

Approach:

quite simple Solution.

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

Complete Code:Run This Code

Run This Code
Output:

Full Nodes are 2 1