Binary Search Tree Traversal

bst-inorder-preorder-postorder.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);
        }
    },
    preOrder: function(node){
        if (node !== null) {
            //print the root node
            console.log(node.toString());             
            //print the left subtree recursively
            this.preOrder(node.left);
            //print the right subtree recursively
            this.preOrder(node.right);
        }
    },
    postOrder: function(node){
        if (node !== null) {           
            //print the left subtree recursively
            this.postOrder(node.left);
            //print the right subtree recursively
            this.postOrder(node.right);
            //print the root node
            console.log(node.toString());              
        }
    }
    /*
    other code htere
    */
}