โ† OYO questions

Find k nearest values to n in a BST

Filed under OYO

Given a Binary Search Tree (BST) and an integer n, find the k values in the tree that have the smallest absolute difference with n.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related OYO questions

Collected from public candidate posts and coding forums. Updated Nov 2026.