In-Order Traversal

Understand the in-order traversal method where nodes in a binary tree are visited in left-root-right sequence. This lesson teaches how to implement this traversal in JavaScript, enabling you to print tree elements in ascending order using recursion.

We'll cover the following...

Introduction
Implementation in JavaScript

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 subtree of the currentNode recursively by calling the inOrderPrint() function on the left child.
Visit currentNode and print its value. ...

1.Introduction to Complexity Measures

2.Introduction to Arrays

3.Introduction to Linked Lists

4.Introduction to Stack/Queues

5.Introduction to Graphs

6.Introduction to Trees

7.Trie

8.Introduction to Heap

9.Introduction to Hashing

10.Summary of Data Structures

Mock Interview

In-Order Traversal

Introduction #