Binary search tree keys within a range

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.