Show Buttons
Share On Facebook
Share On Twitter
Share On Google Plus
Share On Linkdin
Share On Pinterest
Share On Reddit
Share On Stumbleupon
Contact us
Hide Buttons

Print All The Full Nodes in a Binary Tree

Objec­tive: Given a binary tree, print all nodes will are full nodes.

Full Nodes: Nodes Which has both the chil­dren, left and right are called Full Nodes

Approach:

quite sim­ple Solution.

  • Do the any of the tra­ver­sal (inorder, pre­order, pos­torder etc).
  • Dur­ing tra­ver­sal, check the node if it has left child and right child, If yes then print it

Com­plete Code:


Out­put:

Full Nodes are 2 1

You may also like...