Loading...
Trace BFS with a queue and DFS with recursion or a stack
Trace the three binary-tree traversals
Convert between simple infix and RPN expressions
Work through each topic to complete the section.