Skip to content
Related Articles

Related Articles

Improve Article
Print Leaf Nodes at a given Level
  • Difficulty Level : Easy
  • Last Updated : 11 Oct, 2020

Given a Binary tree, print all the leaf nodes of a Binary tree at a given level L.
Examples:

Input:    
           1
          /  \
         2    3
        /    /  \
       4    5    6
 level = 3

Output: 4 5 6

Input:    
             7
            /  \
           2    3
          / \    \
         4   9   10
                 /
                6
   level = 3

Output: 4 9

Approach: Recursively traverse the tree in a level order manner. If the current level is the same as the given level, then check whether the current node is a leaf node or not. If it is a leaf node then print it.
Below is the implementation of the above approach: 
 

C++




// C++ program to print all the
// leaf nodes at a given level
// in a Binary tree
#include <bits/stdc++.h>
using namespace std;
 
// Binary tree node
struct node {
    struct node* left;
    struct node* right;
    int data;
};
 
// Function to create a new
// Binary node
struct node* newNode(int data)
{
    struct node* temp = new node;
 
    temp->data = data;
    temp->left = NULL;
    temp->right = NULL;
 
    return temp;
}
 
// Function to print Leaf Nodes at
// a given level
void PrintLeafNodes(struct node* root, int level)
{
    if (root == NULL)
        return;
 
    if (level == 1) {
        if (root->left == NULL && root->right == NULL)
            cout << root->data << " ";
    }
    else if (level > 1) {
        PrintLeafNodes(root->left, level - 1);
        PrintLeafNodes(root->right, level - 1);
    }
}
 
// Driver code
int main()
{
    struct node* root = newNode(1);
    root->left = newNode(2);
    root->right = newNode(3);
    root->left->left = newNode(6);
    root->right->right = newNode(4);
    root->left->left->left = newNode(8);
    root->left->left->right = newNode(7);
 
    int level = 4;
 
    PrintLeafNodes(root, level);
 
    return 0;
}
Java



// Java program to print all the
// leaf nodes at a given level
// in a Binary tree
class GFG
{
 
    // Binary tree node
    static class node
    {
 
        node left;
        node right;
        int data;
    };
 
    // Function to create a new
    // Binary node
    static node newNode(int data)
    {
        node temp = new node();
 
        temp.data = data;
        temp.left = null;
        temp.right = null;
 
        return temp;
    }
 
    // Function to print Leaf Nodes at
    // a given level
    static void PrintLeafNodes(node root, int level)
    {
        if (root == null)
        {
            return;
        }
 
        if (level == 1)
        {
            if (root.left == null && root.right == null)
            {
                System.out.print(root.data + " ");
            }
 
        }
        else if (level > 1)
        {
            PrintLeafNodes(root.left, level - 1);
            PrintLeafNodes(root.right, level - 1);
        }
    }
 
    // Driver code
    public static void main(String[] args)
    {
        node root = newNode(1);
        root.left = newNode(2);
        root.right = newNode(3);
        root.left.left = newNode(6);
        root.right.right = newNode(4);
        root.left.left.left = newNode(8);
        root.left.left.right = newNode(7);
 
        int level = 4;
 
        PrintLeafNodes(root, level);
    }
}
 
// This code contributed by Rajput-Ji
Python3



# Python3 program to print all the
# leaf nodes at a given level
# in a Binary tree
 
# Binary tree node
class node:
     
    def __init__(self, data):
        self.left=None
        self.right=None
        self.data=data
  
# Function to create a new
# Binary node
def newNode(data):
    return node(data)
  
# Function to print Leaf Nodes at
# a given level
def PrintLeafNodes(root, level):
    if (root == None):
        return
  
    if (level == 1):
        if (root.left == None and
            root.right == None):
            print(root.data, end = " ")
     
    elif (level > 1):
        PrintLeafNodes(root.left, level - 1)
        PrintLeafNodes(root.right, level - 1)
         
if __name__=="__main__":
     
    root=newNode(1)
    root.left = newNode(2);
    root.right = newNode(3);
    root.left.left = newNode(6);
    root.right.right = newNode(4);
    root.left.left.left = newNode(8);
    root.left.left.right = newNode(7);
    level = 4;
    PrintLeafNodes(root, level);
 
# This code is contributed by rutvik_56
C#



// C# program to print all the
// leaf nodes at a given level
// in a Binary tree
using System;
 
class GFG
{
 
    // Binary tree node
    public class node
    {
 
        public node left;
        public node right;
        public int data;
    };
 
    // Function to create a new
    // Binary node
    static node newNode(int data)
    {
        node temp = new node();
 
        temp.data = data;
        temp.left = null;
        temp.right = null;
 
        return temp;
    }
 
    // Function to print Leaf Nodes at
    // a given level
    static void PrintLeafNodes(node root, int level)
    {
        if (root == null)
        {
            return;
        }
 
        if (level == 1)
        {
            if (root.left == null && root.right == null)
            {
                Console.Write(root.data + " ");
            }
 
        }
        else if (level > 1)
        {
            PrintLeafNodes(root.left, level - 1);
            PrintLeafNodes(root.right, level - 1);
        }
    }
 
    // Driver code
    public static void Main(String[] args)
    {
        node root = newNode(1);
        root.left = newNode(2);
        root.right = newNode(3);
        root.left.left = newNode(6);
        root.right.right = newNode(4);
        root.left.left.left = newNode(8);
        root.left.left.right = newNode(7);
 
        int level = 4;
 
        PrintLeafNodes(root, level);
    }
}
 
// This code has been contributed by 29AjayKumar
Output: 
8 7


 
Time Complexity:O(N) where N is the number of nodes in a binary tree.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.
In case you wish to attend live classes with industry experts, please refer DSA Live Classes 



My Personal Notes
arrow_drop_up
Previous
Number of strings that satisfy the given condition
Next

Program for power of a complex number in O(log n)
Recommended Articles
Page :
Sum of Bitwise AND of the sum of all leaf and non-leaf nodes for each level of a Binary Tree
17, Feb 21
Print the nodes corresponding to the level value for each level of a Binary Tree
12, Oct 20
Print nodes of a Binary Search Tree in Top Level Order and Reversed Bottom Level Order alternately
21, Sep 20
Print the longest leaf to leaf path in a Binary tree
24, May 18
Sum of leaf nodes at minimum level
14, Dec 17
Modify a Binary Tree by adding a level of nodes with given value at a specified level
26, Apr 21
Difference between sums of odd level and even level nodes of a Binary Tree
19, Aug 13
Connect Nodes at same Level (Level Order Traversal)
16, Aug 17
Count nodes from all lower levels smaller than minimum valued node of current level for every level in a Binary Tree
14, Sep 20
Difference between sums of odd level and even level nodes in an N-ary Tree
07, Sep 20
Calculate sum of all nodes present in a level for each level of a Tree
05, Feb 21
Construct a Tree whose sum of nodes of all the root to leaf path is not divisible by the count of nodes in that path
19, Mar 21
Print all nodes that are at distance k from a leaf node
25, Feb 14
Print all leaf nodes of a Binary Tree from left to right
30, Sep 17
Print Sum and Product of all Non-Leaf nodes in Binary Tree
29, Oct 18
Print the nodes of binary tree as they become the leaf node
28, Nov 18
Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
14, Feb 19
Print leaf nodes in binary tree from left to right using one stack
11, Mar 19
Print all leaf nodes of a binary tree from right to left
26, Mar 19
Print all leaf nodes of an n-ary tree using DFS
20, May 19
Print left and right leaf nodes separately in Binary Tree
09, Jan 20
Print the nodes that are just above the leaf node
08, Jul 20
Print all root-to-leaf paths with maximum count of even nodes
25, Oct 20
Print nodes between two given level numbers of a binary tree
19, Oct 14
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Sakshi_Srivastava
@Sakshi_Srivastava
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox