visualizing-binary-tree/index.html at master · hnhtag/visualizing-binary-tree · 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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
<html>

<head>
    <meta charset="UTF-8">
     <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>
        Visualizing a Binary Tree in Javascript - Hein Htet Aung
    </title>
    <script language="javascript" type="text/javascript"
        src="https://cdn.jsdelivr.net/npm/p5@1.0.0/lib/p5.min.js"></script>
    <script language="javascript" type="text/javascript" src="node.js"></script>
    <script language="javascript" type="text/javascript" src="tree.js"></script>
</head>

<body style="background-color: #333333; padding: 0; margin: 0;">
    <div style="background-color: white; padding: 20px;">
        <div>
            <h1>Visualizing a Binary Tree in Javascript</h1>
            <h2>Analysis of Algorithms</h2>
        </div>
        <br>
        <label for="node">Add a node:</label> <input type="number" name="node" id="node" min="-99" max="99"><input
            type="button" value="Add" onclick="addNode()">
        <label for="findNode">Find a node:</label>
        <input type="number" name="findNode" id="findNode" min="-99" max="99"><input type="button" value="Find"
            onclick="findNode()">

        <div style="display: inline-flex; border: 1px solid gray;width: 300px;padding: 5px 10px;border-radius: 4px;"
            id="status">Status:</div>
        <p><em><q>Input limit: -99 &le; node &le; 99</q></em></p>
        <p><small><a href="./credits.html">Credits</a> <a href="https://github.com/hnhtag/visualizing-binary-tree">Source code</a></small></p>
        <!-- <label for="removeNode">Remove: </label> <input type="number" name="removeNode" id="removeNode" min="-99"
            max="99">
        <input type="button" value="Remove" onclick="removeNode()">
        <input type="button" value="Refresh" onclick="setup()"> -->

    </div>
    <br><br>
    <div style="height: 10%;"></div>
    <script>

        var tree = new Tree();
        var newNodeText;
        var findNodeText;
        // var removeNodeText;
        var nodes = [10, 9, 11];

        var newNodeTag = document.getElementById("node")
        var findNodeTag = document.getElementById("findNode")
        // var removeNodeTag = document.getElementById("removeNode")
        var statusTag = document.getElementById("status");

        var w = window.innerWidth;
        var h = window.innerHeight;

        function setup() {
            console.log(nodes);
            createCanvas(w - (w * 0.1), h - (h * 0.2));
            background(51);
            for (var i = 0; i < nodes.length; i++) {
                tree.addValue(nodes[i]);
            }
            tree.traverse();
        }

        function addNode() {
            newNodeText = newNodeTag.value;
            if (!newNodeText || newNodeText > 99 || newNodeText < -99) return;
            var res = nodes.find((node) => node == newNodeText)
            if (!!res) return
            nodes.push(Number.parseInt(newNodeText));
            statusTag.innerHTML = "Status: node " + newNodeText + " is added.";
            statusTag.style.color = "green";
            clearStatus();
            setup(nodes);
        }

        function findNode() {
            findNodeText = findNodeTag.value;
            if (!findNodeText || findNodeText > 99 || findNodeText < -99) return;
            var result = tree.search(findNodeText);
            if (result == null) {
                console.log('not found');
                statusTag.style.color = "red";
                statusTag.innerHTML = "Status: node " + findNodeText + " is not found.";
            } else {
                console.log(result);
                statusTag.style.color = "green";
                statusTag.innerHTML = "Status: node " + findNodeText + " is found.";

                ellipse(result.x, result.y, 40, 40);
                setTimeout(() => {
                    setup()
                }, 2000);
            }
            clearStatus()
        }

        // function removeNode() {
        //     removeNodeText = removeNodeTag.value
        //     if (!removeNodeText || removeNodeText > 99 || removeNodeText < -99) return
        //     console.log("remove", removeNodeText);
        //     nodes = nodes.filter(node => node != removeNodeText);
        //     setup(nodes)
        // }

        // event listener
        newNodeTag.addEventListener("keyup", function (event) {
            if (event.keyCode === 13) {
                event.preventDefault();
                addNode()
            }
        });

        findNodeTag.addEventListener("keyup", function (event) {
            if (event.keyCode === 13) {
                event.preventDefault();
                findNode()
            }
        });

        // removeNodeTag.addEventListener("keyup", function (event) {
        //     // Number 13 is the "Enter" key on the keyboard
        //     if (event.keyCode === 13) {
        //         event.preventDefault();
        //         removeNode()
        //     }
        // });

        function clearStatus() {
            setTimeout(() => {
                statusTag.style.color = "";
                statusTag.innerHTML = "Status:"
            }, 3000);
        }

    </script>
</body>

</html>