30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

Sign in / Sign up

Search

⌘K

Pricing Become a Coach

Search

⌘K

Get Premium

Leetcode 230. Kth Smallest Element in a BST

Return the k-th smallest value (1-indexed) in a BST — exploit that an in-order traversal yields values in sorted order and pick the k-th visited node. For frequent updates/queries, augment the BST with subtree sizes (an order-statistic tree) to support O(log n) queries and updates.

Asked at:

Amazon

Google

Meta

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Early March, 2025

Meta

Senior

Early February, 2025

Google

Junior

Mid January, 2025

Amazon

Senior

Find the kth smallest element in a BST

Get Premium to View All 10+ Reports

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content