nearest-neighbor binary search in BST

Q: Given a BST of integers, find the node closest to a target float value

I will update variables “upper” and “lower” during my progressive search until I identify the nearest neighbors. I should be able to write this in c++.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s