In-Order Traversal

In this lesson, we will cover In-Order Traversal and implement it in C++.

We'll cover the following

Introduction
Implementation in C++
- Putting it in the BinarySearchTree Class
- Explanation

Introduction #

In in-order traversal, the elements are traversed in “left-root-right” order, so they are traversed in order. In other words, elements are printed in sorted ascending order with this traversal. We first visit the left child, then the root/parent node, and then the right child. Here is a high-level description of the in-order traversal algorithm,

Traverse the left sub-tree of the current node recursively by calling the inOrderPrint() function on it.
Visit the current node and print its value.
Traverse the right sub-tree of the current node recursively by calling the inOrderPrint() function on it.

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

Introduction to Complexity Measures

Introduction to Arrays

Introduction to Linked Lists

Introduction to Stack/Queues

Introduction to Graphs

Introduction to Trees

Trie

Introduction to Heap

Introduction to Hashing

Summary of Data Structures

In-Order Traversal

Introduction #