Pre-Order Traversal

In this lesson, we will cover the traversal strategy, 'Pre-Order Traversal' in a Binary Search Tree, and implement it in C++.

We'll cover the following

Introduction #

In this traversal, the elements are traversed in the root-left-right order. We first visit the root/parent node, then the left child, and then 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 sub-tree of the current node.

  3. Call the preOrderPrint() function on the right sub-tree of the current node.

Create a free account to view this lesson.

Continue your learning journey with a 14-day free trial.

By signing up, you agree to Educative's Terms of Service and Privacy Policy