Learning JavaScript Data Structures and Algorithms - Third Edition

In-order traversal

An in-order traversal visits all the nodes of a BST in an ascending order, meaning it will visit the nodes from the smallest to the largest. An application of in-order traversal would be to sort a tree. Let's check out its implementation:

inOrderTraverse(callback) {
  this.inOrderTraverseNode(this.root, callback); // {1}
}

The inOrderTraverse method receives a callback function as a parameter. This function can be used to perform the action we want to execute when the node is visited (this is known as the visitor pattern; for more information on this, refer to: http://en.wikipedia.org/wiki/Visitor_pattern). Since most of the algorithms we are implementing for the BST are recursive, we will use a helper method that will receive ...