Pre-Order Traversal

Introduction #

In pre-order traversal, the current node will be visited before its children nodes. Therefore, it is called the pre-order traversal.

The root of the tree will always be the first one to be visited.

In pre-order traversal, the elements are traversed in “root-left-right” order.

Here is a high-level description of the algorithm for Pre-Order traversal, starting from the root node:

1. Visit the currentNode, i.e., print the value stored at the node

2. Call the preOrderPrint() function on the left subtree of the currentNode.

3. Call the preOrderPrint() function on the right subtree of the currentNode.