Leetcode Problem 272. Closest Binary Search Tree Value II

272. Closest Binary Search Tree Value II

Leetcode Solutions

Perform an inorder traversal of the BST and store the values in a sorted array.
Find the index of the element closest to the target using a linear scan or binary search.
Initialize two pointers, left and right, at the closest element's index.
While the window size is less than k, compare the elements at left - 1 and right + 1 to the target and expand the window towards the closer element.
Once the window size reaches k, return the elements within the window.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen