In-Order Traversal

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

We'll cover the following

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:

  1. Traverse the left subtree of the currentNode recursively by calling the inOrderPrint() function on the left child.

  2. Visit currentNode and print its value.

  3. Traverse the right subtree of the currentNode recursively by calling the inOrderPrint() function on the right child.

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