Asked in Flipkart
Given the root of a binary search tree (BST) and an integer k, return the kth largest value (1-indexed) of all the values in the tree.
AnswerBot
9mo
Find the Kth largest element in a Binary Search Tree.
Perform reverse inorder traversal to visit nodes in descending order.
Keep track of the count of visited nodes to find the Kth largest element.
Stop ...read more
Help your peers!
Add answer anonymously...
Top Software Developer Interview Questions Asked at Flipkart
Q. Describe a problem that can be solved using the two-pointer technique.
Q. Implement Depth First Search (DFS) traversal on a simple graph.
Q. Describe a time you used topological sort to find the order of nodes in a graph.
Interview Questions Asked to Software Developer at Other Companies
Top Skill-Based Questions for Flipkart Software Developer
Algorithms Interview Questions and Answers
250 Questions
Data Structures Interview Questions and Answers
250 Questions
Web Development Interview Questions and Answers
250 Questions
Java Interview Questions and Answers
250 Questions
SQL Interview Questions and Answers
250 Questions
Software Development Interview Questions and Answers
250 Questions
Stay ahead in your career. Get AmbitionBox app
Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2025 Info Edge (India) Ltd.
Follow Us
