• 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

Length of the longest substring without repeating characters

K’th Largest Element in BST when modification to BST is not allowed

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

Binary Tree in Java

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Password Predictor

Doubly linked list

VMWare Openings

Find the kth number with prime factors 3, 5 and 7

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Urban Ladder Written Test.

Hackerearth : Counting Subarrays

Subset Sum Problem Dynamic programming

Sequence Finder Dynamic Programming

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Difference between a LinkedList and a Binary Search Tree BST

Generate largest number arranging a no. of given non negative integer numbers

TicTacToe Game As Asked in Flipkart

SAP Off Campus Hiring_ March 2015 Sample Questions

Find the number ABCD such that when multipled by 4 gives DCBA.

Find min element in Sorted Rotated Array (Without Duplicates)

Sort Stack in place

Stickler thief

Find next greater number with same set of digits

Cisco Hiring Event 21st – 22nd Feb 2015

LeetCode: Binary Tree Maximum Path Sum

HackeEarth Flipkart’s Drone

Mirror of Tree

Find the element that appears once others appears thrice

Copyright © 2025 · Genesis Framework · WordPress · Log in