• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Print all nodes that are at distance k from a leaf node

October 9, 2014 by Dhaval Dave

Given a Binary Tree and a positive integer k, print all nodes that are distance k from a leaf node.

Here the meaning of distance k from a leaf means k levels higher than a leaf node.
For example if k is more than height of Binary Tree, then nothing should be printed. Expected time complexity is O(n) where n is the number nodes in the given Binary Tree. 

           [1]
          /   \
       [2]     [3]
      /  \     /  \
    [4]  [5] [6]  [7]
    /
  [8]

Here Output should be 1, and 2 for K=2 as both are at 2 distance from leaf nodes.
1 is at K=2 distance from 5 and  2 is K=2 distance from 8.

Method 1)

We are setting some arbitrary large number as height.
with each associated node, will keep this height and decrements it.

eg.
Height[1000]=1
Height [999]=2
Height [998]=4
Height [997]=8
Height [998]=5
Height [999]=3
Height [998]=6
Height [998]=7

When we encounter a node which is leaf (ie. No left no right Sub tree)
we print Height [length+k];

say here

For Node 8K distance node is= 2
For Node 5K distance node is= 1
For Node 6K distance node is= 1

Now think for algorithm on ur own :
else see working code at http://ideone.com/htifVi

Code :

#include <iostream>
using namespace std;
#define MAX_HEIGHT 1000

struct Node
{
    int key;
    Node *left, *right;
};

Node* newNode(int key)
{
    Node* node = new Node;
    node->key = key;
    node->left = node->right = NULL;
    return (node);
}

void kDistantFromLeafUtil(Node* node, int height[], int pathLen, int k)
{
    if (node==NULL) return;

    height[pathLen] =  node->key;
    pathLen--;

    if(node->left == NULL && node->right == NULL){
       cout <<"For Node "<<node->key <<"K distance node is= "<< height[pathLen+k+1] << " "<<endl;
       return;
    }
    kDistantFromLeafUtil(node->left, height,  pathLen, k);
    kDistantFromLeafUtil(node->right, height,  pathLen, k);
}

void printKDistantfromLeaf(Node* node, int k)
{
    int height[MAX_HEIGHT];
    bool visited[MAX_HEIGHT] = {false};
    kDistantFromLeafUtil(node, height, 1000, k);
}

int main()
{
    Node * root = newNode(1);
    root->left = newNode(2);
    root->right = newNode(3);
    root->left->left = newNode(4);
    root->left->right = newNode(5);
    root->right->left = newNode(6);
    root->right->right = newNode(7);
    root->left->left->right = newNode(8);
    printKDistantfromLeaf(root, 2);

    return 0;
}

 

Method 2) Instead decrementing  pathLen we can think for approch where we can increment pathLen in order to decrease memory usage.

Changes required

void kDistantFromLeafUtil(Node* node, int height[], int pathLen, int k)
{
    if (node==NULL) return;

    height[pathLen] =  node->key;
    pathLen++;
//SEE CHANGES

if(node->left == NULL && node->right == NULL){
    cout <<“For Node “<<node->key <<“K distance node is= “<< height[pathLen-k-1] << ” “<<endl;
// SEE CHANGES
    return;
}
    kDistantFromLeafUtil(node->left, height,  pathLen, k);
    kDistantFromLeafUtil(node->right, height,  pathLen, k);
}

IN  void printKDistantfromLeaf(Node* node, int k){}
kDistantFromLeafUtil(node, height, 0, k);

clash of clans hack no survey

Similar Articles

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Binary Tree, tree

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Minimum insertions to form a palindrome

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Python Dictionaries

Python String and numbers

Amazon Interview On-Campus For Internship – 1

Trapping Rain Water

VMWare SDEII Interview

Cisco Hiring Event 21st – 22nd Feb 2015

Client Server C program

Code Chef PRGIFT Solution

Daughter’s Age VeryGood Puzzle

C++ OOPs Part2

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Common Ancestor in a Binary Tree or Binary Search Tree

Printing each word reverse in string

Interfaces in C++ (Abstract Classes in C++)

25 horses 5 tracks Find 3 fastest puzzle

Generic Object Oriented Stack with Template

Sort an array according to the order defined by another array

Maximum difference between two elements s.t larger element appears after the smaller number

Binary Tree in Java

Mirror of Tree

Walmart Labs Interview Experience

Coin Collection Dynamic Programming

Given Set of words or A String find whether chain is possible from these words or not

The greedy coins game Dynamic Programming

Fibonacci Hashing & Fastest Hashtable

Find loop in Singly linked list

Leetcode: Merge Intervals

Number of Islands BFS/DFS

Copyright © 2025 · Genesis Framework · WordPress · Log in