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. ...

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 #