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 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:Top 25 Interview Problems on Binary Trees/Binary Search TreesCount the number of nodes in a given binary treeGraph – Depth First TraversalHeap Sort – Java ImplementationGraph – Print all paths between source and destinationGraph Implementation – Adjacency List - Better| Set 2k-Nearest NeighborsGraph Implementation – Adjacency Matrix | Set 3Djkstra's – Shortest Path Algorithm (SPT)Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue…Share this:LinkedInPrintTumblrFacebookTwitterEmailRedditLike this:Like Loading...