Write the in-order walk
Level 7: Lists & trees. The recursive case is the whole algorithm. The base case is the null pointer, -1, and it must come first or the walk never stops.
Level 7: Lists & trees. The recursive case is the whole algorithm. The base case is the null pointer, -1, and it must come first or the walk never stops.