Given a binary tree, count leaves in the tree without using recursion. A node is a leaf node if both left and right children of it are NULL.
Example Tree Leaves count for the above tree is 3.
The idea is to use level order traversal. During traversal, if we find a node whose left and right children are NULL, we increment count.
Time Complexity: O(n)
This article is contributed by Mr. Somesh Awasthi. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Program to count leaf nodes in a binary tree
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Count Non-Leaf nodes in a Binary Tree
- Count half nodes in a Binary tree (Iterative and Recursive)
- Count full nodes in a Binary tree (Iterative and Recursive)
- Deepest right leaf node in a binary tree | Iterative approach
- Deepest left leaf node in a binary tree | iterative approach
- Sum of all leaf nodes of binary tree
- Product of all leaf nodes of binary tree
- Determine the count of Leaf nodes in an N-ary tree
- Maximum sum of non-leaf nodes among all levels of the given binary tree
- Maximum sum of leaf nodes among all levels of the given binary tree
- Print Sum and Product of all Non-Leaf nodes in Binary Tree
- Pairwise Swap leaf nodes in a binary tree
- Print all leaf nodes of a Binary Tree from left to right
Improved By : PranchalKatiyar