Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Changed find(int key) method to return null when node is not found, and updated docs accordingly. Issue #104.

Browse Source
This commit is contained in:
mpokryva 2017-09-29 11:21:47 -04:00
parent 0aee19d427
commit e5381585a5
1 changed files with 141 additions and 143 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
data_structures/Trees/BinaryTree.java
View File

@ -67,18 +67,16 @@ class Tree{
*/ */
public Node find(int key) { public Node find(int key) {
Node current = root; Node current = root;
Node last = root;
while (current != null) { while (current != null) {
last = current; if(key < current.data) {
if(key < current.data)
current = current.left; current = current.left;
else if(key > current.data) } else if(key > current.data) {
current = current.right; current = current.right;
//If you find the value return it } else { // If you find the value return it
else
return current; return current;
} }
return last; }
return null;
} }
/** /**