-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinarySearchTree.php
More file actions
265 lines (237 loc) · 6.05 KB
/
BinarySearchTree.php
File metadata and controls
265 lines (237 loc) · 6.05 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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
<?php
namespace danlex\bst;
/*
* Binary Search Tree
* @package danlex
* @subpackage bst
* @author Alexandru Dan <dan_lex@yahoo.com>
*/
class BinarySearchTree{
/*
* @access private
* @var Node
*/
private $root = NULL;
public function __construct(){
}
/*
* @return BinarySearchTree
*/
public function getRoot(){
return $this->root;
}
/*
* @param Node $node
* @return BinarySearchTree
*/
public function setRoot(Node $node){
$this->root = $node;
return $this;
}
/*
* @param int $data
* @return BinarySearchTree
*/
public function insert($data){
if ($root = $this->getRoot() === NULL){
$this->setRoot($this->createNewNode($data));
} else {
$this->insertRec($this->getRoot(), $data);
}
return $this;
}
/*
* @param Node $node
* @param int $data
* @return BinarySearchTree
*/
public function insertRec(Node $node, $data){
if($data < $node->getData()){
$leftNode = $node->getLeftNode();
if($leftNode !== NULL){
$this->insertRec($leftNode, $data);
} else {
$node->setLeftNode($this->createNewNode($data));
}
} else {
$rightNode = $node->getRightNode();
if($rightNode !== NULL){
$this->insertRec($rightNode, $data);
} else {
$node->setRightNode($this->createNewNode($data));
}
}
}
/*
* @access protected
* @param int $data
* @return BinarySearchTree
*/
protected function createNewNode($data){
$newNode = new Node();
$newNode->setData($data);
return $newNode;
}
/*
* Print tree
*/
public function printTree(){
echo $this->printTreeRec($this->getRoot());
}
/*
* @access private
* @param Node $node NULL
* @return string
*/
private function printTreeRec(Node $node = NULL){
if($node === NULL){
return '';
} else {
return
$this->printTreeRec($node->getLeftNode())
. ' '.$node->getData()
. $this->printTreeRec($node->getRightNode());
}
}
/*
* @param Array $array
*/
public function createFromArray(Array $array){
foreach($array as $item){
$this->insert($item);
}
return $this;
}
/*
* @return Array
*/
public function toArray(){
$root = $this->getRoot();
if ($root === NULL){
return array();
}
return $this->toArrayRec($root);
}
/*
* @access private
* @param Node $node NULL
* @return array
*/
private function toArrayRec(Node $node){
$leftNode = $node->getLeftNode();
$rightNode = $node->getRightNode();
if ($leftNode === NULL && $rightNode === NULL){
return $node->getData();
}
if ($leftNode !== NULL) {
$return[$node->getData()]['left'] = $this->toArrayRec($leftNode);
}
if ($rightNode !== NULL){
$return[$node->getData()]['right'] = $this->toArrayRec($rightNode);
}
return $return;
}
/*
* @param int $data
* @return boolean
*/
public function lookup($data){
return $this->lookupRec($this->getRoot(), $data);
}
/*
* @access private
* @param Node $node NULL
* @param int $data
* @return boolean
*/
private function lookupRec(Node $node = NULL, $data){
if ($node === NULL) {
return false;
} elseif($data === $node->getData()){
return true;
} elseif($node->getData() < $data){
return $this->lookupRec($node->getRightNode(), $data);
} else {
return $this->lookupRec($node->getLeftNode(), $data);
}
}
/*
*
* @param int $nodesCount
* @return int
*/
public function countTrees($nodesCount){
if($nodesCount === 0){
return 1;
} elseif($nodesCount === 1){
return 1;
} else {
$countTrees = 0;
for($i = 1; $i <= $nodesCount; $i++){
$countTrees += $this->countTrees($i - 1) * $this->countTrees($nodesCount - $i);
}
return $countTrees;
}
}
/*
* calculate the number of nodes in the tree
* @return int
*/
public function size(){
return $this->sizeRec($this->getRoot());
}
/*
* calculate the number of nodes of the subtree
* @access private
* @return int
*/
private function sizeRec(Node $node = NULL){
if($node === NULL) {
return 0;
} else {
return $this->sizeRec($node->getLeftNode()) + 1 + $this->sizeRec($node->getRightNode());
}
}
/*
* @return boolean
*/
public function isBST(){
return $this->isBSTRec($this->getRoot(), -PHP_INT_MAX, PHP_INT_MAX);
}
/*
* @access private
* @param Node $node
* @param int min
* @param int max
* @return booleaan
*/
private function isBSTRec(Node $node = NULL, $min, $max){
if ($node === NULL){
return true;
} elseif($node->getData() < $min || $node->getData() > $max) {
return false;
} else {
return
$this->isBSTRec($node->getLeftNode(), $min, $node->getData()) &&
$this->isBSTRec($node->getRightNode(), $node->getData(), $max);
}
}
/*
*/
public function printPaths(){
$path = array();
$htis->printPathsRec($this->getRoot(), $path, 0);
}
/*
* @access private
* @param Node $node
*/
private function printPathsRec(Node $node = NULL, $path = array(), $pathLen = 0) {
if ($node === NULL){
return;
} else {
$this->pathLen ++;
$this->path[$this->pathLen] = $node->getData();
}
}
}