forked from aishraj/JavaScript-Interview-Questions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path001.js
More file actions
140 lines (126 loc) · 3.49 KB
/
Copy path001.js
File metadata and controls
140 lines (126 loc) · 3.49 KB
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
/*
* <!--
* This program is distributed under
* the terms of the MIT license.
* Please see the LICENSE file for details.
* -->
*/
/*
* A Tree is a data structure that consists of zero or more child Nodes, where
* each child Node can also have zero or more child Nodes.
*
* Implement an _"immutable"_ tree Node in JavaScript.
* That is to say, once constructed, it should be impossible to alter
* the Node's value, or add/remove a child node to it.
*
* Assume that a Node can have zero or more child Nodes and each
* Node will be only storing primitive integer values.
*
* Provide getter functions for your Node implementation that return:
*
* - A reference to the Node's child Node at a given index.
* - The Node's child count.
* - The Node's current value.
*
* Example:
*
* var leaf1 = new Node(null, 1);
* var leaf2 = new Node(null, 2);
* var root = new Node([leaf1, leaf2], 3);
*
* should give the following data structure
*
* (root){3}
* / \
* / \
* (leaf1){1} (leaf2){2}
*
* where `root.getChild(1).getValue()` should give you `2`.
*
* Hint: You can use the `Module Pattern`.
*/
/*____________________________________________________________________________*/
(function(context) {
/*
* The node collection.
* Note that it's impossible to reach it outside this module.
* And we will provide a very restricted access to it through
* the `context.Node` "facade" below.
*/
var nodes = {};
var counter = 0;
var kNodeKey = 'n';
var kEmpty = '';
/**
* @class {public} Node
*
* Creates a simple node.
*
* @param {Node[]} children - an array of child nodes.
* @param {Integer} value - the value of the node.
*/
context.Node = function(children, value) {
this.id = [Math.random(), kNodeKey, counter++].join(kEmpty);
nodes[this.id] = {
children : (children || []),
value : value
};
}
/**
* @function {public} Node.getChildCount
*
* Gets the child count of the node.
*
* @return the child count.
*/
context.Node.prototype.getChildCount = function() {
return nodes[this.id].children.length;
};
/**
* @function {public} Node.getChild
*
* Gets the child of the node at a given index.
*
* @param {Integer} index - the index to get.
*
* @return the child node at the given index.
*/
context.Node.prototype.getChild = function(index) {
return nodes[this.id].children[index];
};
/**
* @function {public} Node.getValue
*
* Gets the value of the node.
*
* @return the `Integer` value of the node.
*/
context.Node.prototype.getValue = function() {
return nodes[this.id].value;
}
}(this));
/*____________________________________________________________________________*/
var leaf1 = new this.Node(null, 1);
var leaf2 = new this.Node(null, 2);
var root = new this.Node([leaf1, leaf2], 3);
console.log(root);
console.log(root.getChildCount());
console.log(root.getValue());
console.log(root.getChild(0));
console.log(root.getChild(0).getChildCount());
console.log(root.getChild(0).getValue());
console.log(root.getChild(1));
console.log(root.getChild(1).getChildCount());
console.log(root.getChild(1).getValue());
/*
Output: ($ /usr/bin/node 001.js)
{ id: '0.35295142116956413n2' }
2
3
{ id: '0.6293376912362874n0' }
0
1
{ id: '0.0803379702847451n1' }
0
2
*/