Be the first user to complete this post

  • 0
Add to List

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:

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 right child, If yes then print it

Code:


Output:

Full Nodes are 2 1



Also Read: