BinaryTree/BinaryTree.js at master · mprata/BinaryTree · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
const TreeNode = require('./TreeNode');
const Stack = require('./Stack');
const root = Symbol("root");

class BinaryTree {
    construtor(){
        this[root] = null;
    }

    insert(data){
        let oNode = new TreeNode(data);
        if(this[root] == null){
            this[root] = oNode;
            return;
        }
        this.insertNode(this[root], oNode);
    }

    insertNode(node, newNode){
        let q = [], temp;
        q.unshift(node);

        while (q.length > 0) {
            temp = q.pop();
            if (temp.left == null) {
                temp.left = newNode;
                break;
            } else
                q.unshift(temp.left);

            if (temp.right == null) {
                temp.right = newNode;
                break;
            } else
                q.unshift(temp.right);
        }
    }

    inorder(temp){
        if (temp == null)
            return;
        this.inorder(temp.left);
        process.stdout.write(`${temp.data},`);
        this.inorder(temp.right);
    }

    preorder(temp){
        if (temp == null)
            return;
        process.stdout.write(`${temp.data},`);
        this.preorder(temp.left);
        this.preorder(temp.right);
    }

    preorderWithStack(temp){
        let treeStack = new Stack();
        let ptr = temp;
        while(ptr != null){
            process.stdout.write(`${ptr.data},`);
            if(ptr.right != null){
                treeStack.push(ptr.right);
            }
            if(ptr.left !=null){
                ptr = ptr.left;
            } else {
                ptr = treeStack.pop();
            }
        }

    }

    postorder(temp){
        if (temp == null)
            return;
        this.postorder(temp.left);
        this.postorder(temp.right);
        process.stdout.write(`${temp.data},`);
    }
}

let btree = new BinaryTree();
btree.insert(10);
btree.insert(11);
btree.insert(7);
btree.insert(9);
btree.insert(15);
btree.insert(8);
console.log("\nPreorder :");
btree.preorder(btree[root]);
console.log("\nPreorder with stack:");
btree.preorderWithStack(btree[root]);
console.log("\nInorder :");
btree.inorder(btree[root]);
console.log("\nPostorder :");
btree.postorder(btree[root]);