Pre-Order Traversal

Introduction

In this traversal, the elements are traversed in the root-left-right order. First visit the root/parent node, then the left child. Then visit the right child. Here is a high-level description of the algorithm for pre-order traversal starting from the root node:

1. Visit the current node, 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.