In-Order Traversal

Introduction

In the “in-order” traversal, the elements are traversed in “left-root-right” order. They are traversed in order. In other words, elements are printed in sorted ascending order with this traversal. 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 it. ...