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

Run This Code

Code:

Output:

Full Nodes are 2 1

Also Read:

- AVL Tree - Insertion Hard
- Find The Distance From Root To Given Node of a Binary Tree. Medium
- Divide and Conquer - Rearrange array elements in special order Medium
- Print The Top View of a Binary Tree Medium
- In a Binary Tree, Check if two nodes are Cousins Medium
- Binary Search Beginner
- Depth First Search/Traversal in Binary Tree Beginner
- Print All The Nodes Which are X distance from the Root Medium