← Questions
Binary search tree keys within a range
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a binary search tree (as a level-order list with nulls for missing children) and an inclusive range [low, high], return every key in the range in ascending order. Skip the subtrees that cannot hold a key in the range.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding