-
Notifications
You must be signed in to change notification settings - Fork 0
/
FindHalfNodes.java
43 lines (33 loc) · 944 Bytes
/
FindHalfNodes.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
// Find an algorithm for finding the number of half nodes in the binary tree
import java.util.Stack;
public class FindHalfNodes extends BinaryTree{
public static int HalfNodeCounter(Node root) {
Node current;
Stack<Node> stack = new Stack<Node>();
int counter = 0;
if(root != null) {
current = root;
stack.push(current);
}
else {
return 0;
}
while(!stack.isEmpty()) {
current = stack.pop();
System.out.println("Current data "+current.data);
if((current.left == null && current.right != null) ||
(current.left != null && current.right == null)) {
System.out.println("Current data is "+current.data);
counter++;
}
if(current.right != null)
stack.push(current.right);
if(current.left != null)
stack.push(current.left);
}
return counter;
}
public static void main(String[] args) {
System.out.println(HalfNodeCounter(BinaryTree.BinaryTree2()));
}
}