I am reading the blog post on preorder traversal of binary tree and I am having trouble understanding the recursive approach. Can someone please explain it in more detail?
In particular, I am confused about the following steps:
Why do we first call the root of the current tree?
What does it mean to "recur on the left subtree"?
What does it mean to "recur on the right subtree"?
I would appreciate any help you can provide.