Pre-Order Traversal

In this lesson, we will cover the traversal strategy, 'Pre-Order Traversal' in a Binary Search Tree, and its implementation it in Python

We'll cover the following

Introduction #

In this traversal, the elements are traversed in “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’.

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.