InOrder Traversal
In this lesson, we will cover InOrder Traversal and implement it in JavaScript.
We'll cover the following
Introduction #
In inorder traversal, the elements are traversed in “leftrootright” 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 highlevel description of the inorder traversal algorithm:

Traverse the left subtree of the
currentNode
recursively by calling theinOrderPrint()
function on the left child. 
Visit
currentNode
and print its value. 
Traverse the right subtree of the
currentNode
recursively by calling theinOrderPrint()
function on the right child.
Level up your interview prep. Join Educative to access 80+ handson prep courses.