-
Notifications
You must be signed in to change notification settings - Fork 0
/
HeightOfTheTree.java
81 lines (62 loc) · 1.86 KB
/
HeightOfTheTree.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
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
// Find the Height of the tree
//https://leetcode.com/problems/maximum-depth-of-binary-tree/description/#
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
public class HeightOfTheTree extends BinaryTree{
// Height of the tree - Recursively
public static int heightRecursively(BinaryTreeNode root) {
int height = 0;
if(root != null) {
int leftHeight = heightIteratively(root.left);
int rightHeight = heightIteratively(root.right);
height = Math.max(leftHeight, rightHeight) +1;
}
return height;
}
// Height of the tree Iteratively
public static int heightIteratively(BinaryTreeNode root) {
BinaryTreeNode current = root;
// Level Order Traversal
Queue<BinaryTreeNode> queue = new LinkedList<BinaryTreeNode>();
int counter = 0;
// Using null as a separator of the levels
if(current != null) {
queue.add(current);
queue.add(null);
}
while(true) {
current = queue.poll();
// Add a null to the queue when encountered with a null
if(current == null) {
counter++;
if(queue.isEmpty())
break;
current = queue.poll();
queue.offer(null);
}
if(current.left != null)
queue.add(current.left);
if(current.right != null)
queue.add(current.right);
}
return counter;
}
// Height of the tree using stack - yet to be done
public static int heightIterativeUsingStack(BinaryTreeNode root) {
BinaryTreeNode current = root;
Stack <BinaryTreeNode> stack = new Stack<BinaryTreeNode>();
int heightCounter = 0;
if(root != null) {
current = root;
stack.add(current);
stack.add(null);
}
return heightCounter;
}
public static void main(String[] args) {
HeightOfTheTree heightOfTheTree = new HeightOfTheTree();
heightOfTheTree.setRoot(new BinaryTreeNode(1));
System.out.println(heightRecursively(heightOfTheTree.treeExample1()));
}
}