-
Notifications
You must be signed in to change notification settings - Fork 0
/
NumberOfLeafNode.java
54 lines (45 loc) · 1.21 KB
/
NumberOfLeafNode.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
import java.util.LinkedList;
import java.util.Queue;
// Find the number of leaves in the binary tree
public class NumberOfLeafNode extends BinaryTree{
public static void main(String[] args) {
System.out.println(noOfLeafNodesRecursively(BinaryTree3()));
}
// Number of Leaf Nodes - Iteratively
public static int noOfLeafNodes(Node root) {
Node current = null;
Queue<Node> queue= new LinkedList<Node>();
int leafCounter = 0;
if(root == null)
return 0;
else {
current = root;
queue.add(current);
}
// Leave Order traversal
while(!queue.isEmpty()) {
current = queue.poll();
// Counter for leaf nodes
if((current.left == null) && (current.right == null))
leafCounter++;
if(current.left != null)
queue.add(current.left);
if(current.right != null)
queue.add(current.right);
}
return leafCounter;
}
// Number of Leaf Nodes - Recursively
public static int noOfLeafNodesRecursively(Node root) {
if(root == null)
return 0;
// counter for the leaf nodes
if(root.left == null && root.right == null)
return 1;
else {
int left = noOfLeafNodesRecursively(root.left);
int right = noOfLeafNodesRecursively(root.right);
return left+right;
}
}
}