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

Latest commit

 

History

History
History
69 lines (62 loc) · 1.35 KB

File metadata and controls

69 lines (62 loc) · 1.35 KB
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
/*
* <!--
* This program is distributed under
* the terms of the MIT license.
* Please see the LICENSE file for details.
* -->
*/
/*
* Using the node structure in 002.js
* Create the following binary serch tree:
*
* 15
* /\
* 13 20
* /\ /\
* 11 15 18 22
*/
/*____________________________________________________________________________*/
/**
* @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 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
);
/*____________________________________________________________________________*/
console.log(root);
/*
Output: ($ /usr/bin/node 003.js)
{ left:
{ left: { left: null, right: null, value: 11 },
right: { left: null, right: null, value: 15 },
value: 13 },
right:
{ left: { left: null, right: null, value: 18 },
right: { left: null, right: null, value: 22 },
value: 20 },
value: 15 }
*/
Morty Proxy This is a proxified and sanitized view of the page, visit original site.