5.1.3
Trace a recursive algorithm to express a solution to a problem.
Teaching Note:
Students will be required to state the output of the recursive algorithm. For example, trees.
LINK Binary trees.
Sample Question:
JSR Notes:
The first link is the exercises we did to get used to how to trace recursive methods.
1033 exercise Recursion traces
**** Best overall link for this 5.1.3 assessment statement (including video linked below too.)
And a video showing how to do one of the recursive traces.
But according to the teaching note, it's likely to be a trace of a search tree traversal. So note how the output of the animation below is determined.
And also watch the pre-order, in-order, post-order videos from 5.1.16.
2212 animation of Binary Tree traversal trace