forked from joharbatta/DataStructure-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgetLevelNode.java
More file actions
94 lines (82 loc) · 2.03 KB
/
Copy pathgetLevelNode.java
File metadata and controls
94 lines (82 loc) · 2.03 KB
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
82
83
84
85
86
87
88
89
90
91
92
93
94
import java.util.*;
class Node
{
int data;
Node left;
Node right;
Node(int data)
{
this.data=data;
left=right=null;
}
}
class BinaryTree{
Node root;
BinaryTree()
{
root = null;
}
BinaryTree(int data)
{
this.root=new Node(data);
}
public int getLevelOfNode(Node node, int val, int level) {
if(node == null) {
return 0;
}
int l;
if(node.data == val) {
return level;
}
l = getLevelOfNode(node.left, val, level + 1);
if(l != 0) {
return l;
}
l = getLevelOfNode(node.right, val, level + 1);
return l;
}
void getLevelOfNode1(Node root,int val)
{
if (root == null)
return;
Queue<Node> q = new java.util.LinkedList<>();
q.add(root);
int level=1;
while (true)
{
int size = q.size();
if (size == 0)
break;
for (int i = 0; i < size; i++)
{
Node temp = q.remove();
//System.out.print(temp.data + " ");
if(val==temp.data)
{
System.out.println(level);
System.exit(0);
}
if (temp.left != null) {
q.add(temp.left);
}
if (temp.right != null) {
q.add(temp.right);
}
}
level++;
}
}
}
class getLevelNode{
public static void main(String[] args) {
BinaryTree bt=new BinaryTree(2);
bt.root.left=new Node(3);
bt.root.right=new Node(5);
bt.root.left.right=new Node(9);
bt.root.right.left=new Node(7);
bt.root.right.left.right=new Node(12);
System.out.println(bt.getLevelOfNode(bt.root, 7, 1));
//iterative
bt.getLevelOfNode1(bt.root, 12);
}
}