Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Appearance settings

Expand file tree

/

004.js

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
91 lines (79 loc) · 1.84 KB
/

004.js

Copy path

File metadata and controls

91 lines (79 loc) · 1.84 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
/*
* <!--
* This program is distributed under
* the terms of the MIT license.
* Please see the LICENSE file for details.
* -->
*/
/*
* Implement a non-recursive algorithm to look up a node in a binary search tree.
* (i.e. find a node. given its value)
* Use the tree you created in 003.js to test your algorithm.
*/
/*____________________________________________________________________________*/
/**
* @class {public} Node
*
* A typical binary tree node.
*
* @param {Node} left - the left node.
* @param {Node} right - the right node.
* @param {Integer} value - the value of this node.
*/
function Node(left, right, value) {
this.left = left;
this.right = right;
this.value = value;
}
/*
* Sample tree structure.
*/
var root = new Node(
new Node(
new Node(null, null, 11),
new Node(null, null, 15),
13
),
new Node(
new Node(null, null, 18),
new Node(null, null, 22),
20
),
15
);
/**
* @function {public static} findNode
*
* Finds the node with a given value.
*
* @param {Node} root - the root node.
* @param {Integer} value - the value to seek.
*
* @return a reference to the found node if found, `null` otherwise.
*/
function findNode(root, value) {
var current = root;
var val = 0;
while (current) {
val = current.value;
if (val === value) {
break;
}
if (val < value) {
current = current.right;
} else {
current = current.left;
}
}
return current;
}
/*____________________________________________________________________________*/
console.log(findNode(root, 18));
console.log(findNode(root, 22));
console.log(findNode(root, 122));
/*
Output: ($ /usr/bin/node 004.js)
{ left: null, right: null, value: 18 }
{ left: null, right: null, value: 22 }
null
*/
Morty Proxy This is a proxified and sanitized view of the page, visit original site.