-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
70 lines (62 loc) · 1.85 KB
/
index.html
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
<!DOCTYPE html>
<html>
<head lang="en">
<script src="https://code.jquery.com/jquery-1.11.3.min.js"></script>
<script src="binaryTree.js"></script>
<meta charset="UTF-8">
<title></title>
</head>
<body>
<h1> Binary search tree</h1>
<script>
var nums = new BST();
nums.insert(23);
nums.insert(29);
nums.insert(1);
nums.insert(4);
nums.insert(56);
nums.insert(50);
nums.insert(62);
nums.insert(2);
nums.insert(9);
inOrderTraversal(nums.root);
preOrderTraversal(nums.root);
postOrderTraversal(nums.root);
var minimum = nums.getMinimum();
var maximum = nums.getMaximum();
var find = nums.findNode(62);
var removeNode = nums.remove(4);
inOrderTraversal(nums.root);
var remove = nodes.splice(1,9);
$(document).ready(function(){
$("#nodes").append(nodes.join(", "));
$("#nodes2").append(nodes2.join(", "));
$("#nodes3").append(nodes3.join(", "));
$("#getMin").append(minimum);
$("#getMax").append(maximum);
$("#find").append(find);
$("#remove").append(nodes.join(","));
});
</script>
<h2> This is an example how our function traverse the tree </h2>
<p>
INSERTING THE NODES:
nums.insert(23);
nums.insert(29);
nums.insert(1);
nums.insert(4);
nums.insert(56);
nums.insert(50);
nums.insert(62);
nums.insert(2);
nums.insert(9);
</p>
<h3> InorderTraversal: <span id="nodes"> </span> </h3>
<h3> preOrderTraversal: <span id="nodes2"> </span> </h3>
<h3> postOrderTraversal: <span id="nodes3"> </span> </h3>
<h3> Get minimum node in Tree: <span id="getMin"> </span> </h3>
<h3> Get maximum node in Tree: <span id="getMax"> </span> </h3>
<h3> Find: nums.findNode(62) <span id="find"> </span> </h3>
<h3> Removed node: (4): <span id="remove"> </span></h3>
</body>
</html>