• 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

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

March 19, 2015 by Dhaval Dave

Given a Binary Search Tree (BST) and a positive integer k, find the k’th largest element in the Binary Search Tree.

      [20]
      /       
    [8]  [22] 
    /  \
  [5]  [10]
       /  \
     [9]  [12]

For example, in the following BST, if
if k = 3, then output should be 12
if k = 5, then output should be 9.

Method 1)  Brute Force in O(n)

In order of BST gives 5,8,9,10,12,20,22
and print member A[n-k+1] will be out put.

Now Lets discuss tricky way :

As we know that larger elements are in Right Side of a node and smaller in left side for BST.
Can we use this trick ???

Think for above example , R=no if Recursion,
r = 1 we traverse 22 and found that its largest
r = 2 we traverse 20, which is second largest.
r=3 and we went to 12 via 8-10-12 ( first traverse right path always)
so 3rd largest is 12.

So with Post Order Traversal We can find Kth largest in O(k + h) time

So Method 2 ) Post Order Traversal 

Algo . C=Count of node visited, K= Kth number

Function KthLargest(Node *root, int k, int &c)

  1. If root=null or c>= k
    return.
  2. KthLargest ( root->right ,  k, c)
  3. c++
  4. if ( c == k) cout << root -> n;
  5. KthLargest ( root->left ,  k, c)

For queries, suggestion and more questions / solutions please write us at admin@gohired.in

Similar Articles

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Binary Search 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

LeetCode: Binary Tree Maximum Path Sum

Coin Collection Dynamic Programming

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Possible sizes of bus to carry n groups of friends

Find min element in Sorted Rotated Array (With Duplicates)

SAP Interview Questions

flattens 2 D linked list to a single sorted link list

C Program for TAIL command of UNIX

Advanced SQL Injection

Leetcode: Merge Intervals

Best Java Book | Top Java Programming Book for Beginners

Implement a generic binary search algorithm for Integer Double String etc

Maximum sum contiguous subarray of an Array

Find two non repeating elements in an array of repeating elements

SAP Off Campus Hiring_ March 2015 Sample Questions

Trie Dictionary

Find if two rectangles overlap

Level order traversal in Spiral form

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

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

TicTacToe Game As Asked in Flipkart

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Password Predictor

Longest Increasing Subsequence

HackeEarth Flipkart’s Drone

Maximum path sum between two leaves

Leetcode: Edit Distance

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Implement LRU Cache

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Copyright © 2025 · Genesis Framework · WordPress · Log in