-
Notifications
You must be signed in to change notification settings - Fork 0
/
SearchInBinaryTree.java
53 lines (39 loc) · 1.27 KB
/
SearchInBinaryTree.java
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
import java.util.Stack;
//Return true if you find the element in the binary tree
public class SearchInBinaryTree extends BinaryTree{
// Recursive
public boolean searchRecursively(BinaryTreeNode root, int data) {
if(root != null) {
if(root.value == data)
return true;
boolean left = searchRecursively(root.left, data);
boolean right = searchRecursively(root.right, data);
return left || right;
}
return false;
}
// PreOrder Search
public boolean searchPreOrderItr(BinaryTreeNode root, int data) {
if(root == null)
return false;
BinaryTreeNode current = root;
Stack<BinaryTreeNode> stack = new Stack<>();
stack.push(current);
while(!stack.isEmpty()) {
current =stack.pop();
if(current.value == data)
return true;
if(current.right != null)
stack.push(current.right);
if(current.left != null)
stack.push(current.left);
}
return false;
}
public static void main(String[] args) {
SearchInBinaryTree searchInBinaryTree = new SearchInBinaryTree();
searchInBinaryTree.setRoot(new BinaryTreeNode(1));
System.out.println(searchInBinaryTree.searchPreOrderItr(searchInBinaryTree.treeExample(), 7));
System.out.println(searchInBinaryTree.searchRecursively(searchInBinaryTree.treeExample(), 17));
}
}