Print All The Full Nodes in a Binary Tree by SJ · March 14, 2015 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 Output: Full Nodes are 2 1 __________________________________________________ Top Companies Interview Questions..- Google Microsoft Amazon Facebook more.. If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment. __________________________________________________ Related Posts:Binary Tree-Postorder Traversal – Non Recursive ApproachGet the Sum of all left leaves in a Binary treeConvert BST to Greater Sum TreeTop 25 Interview Problems on Binary Trees/Binary Search TreesSearch the Element in a binary tree – With and Without RecursionFind the Size of a Binary Tree without RecursionIntroduction to Threaded Binary TreeTree TraversalsReverse Alternative ‘k’ nodes in a Linked List.Convert Binary Tree into Threaded Binary TreeShare this:LinkedInGooglePrintTumblrFacebookTwitterEmailLike this:Like Loading...