Solution Review: Print Pre-Order Traversal
Let’s go through the detailed solution review of the challenge given in the previous lesson.
We'll cover the following...
Solution
In pre-order traversal, the node is visited first, then its left child (or left subtree), and then its right child (or right subtree). This approach is followed recursively for each node in the tree until we reach the leaf node. Refer to the following illustration to better understandthe algorithm.
While visiting a node, we first print the value stored in the node to the console then continue moving to its left and right children. That’s why the first element printed on the console is always the root node ...