bst-inorder.js

BinarySearchTree.prototype = {
    /*
    other code here
    */
    inOrder: function(node){
        if (node !== null) {
            //print the left subtree recursively
            this.inOrder(node.left);
            //print the root node
            console.log(node.toString()); 
            //print the right subtree recursively
            this.inOrder(node.right);
        }
    }
    /*
    other code htere
    */
}