Search⌘ K
Home
Courses
Data Structures for Coding Interviews in C++

Pre-Order Traversal

Understand pre-order traversal by exploring how to visit nodes in a binary tree in root-left-right order. Learn its implementation in C++, including recursive function calls and time complexity. This lesson helps build a foundation for other tree traversal methods.

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.

Implementation in C++

...