II. Tree Traversal
Pre-order: root → root.left → root.right
In-order: root.left → root → root.right
Post-order: root.left → root.right → root
Tail recursion: when one recursive call is always the last execution statement. It can be easily transferred to a iterative solution
Last updated
Was this helpful?