Question 21 1 pts In order to print out sorted binary tree values (low to high), the traversal needs to be: O in-order O pre-order O post-order O level-by-level (left to right) Question 22 1 pts Fibonacci evaluation tree traversal is most similar to tree traversal O in-order O pre-order O post-order level-by-level