forked from joharbatta/DataStructure-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlevelOrder.java
More file actions
86 lines (75 loc) · 1.96 KB
/
Copy pathlevelOrder.java
File metadata and controls
86 lines (75 loc) · 1.96 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
import java.util.*;
public class levelOrder
{
Node root;
class Node
{
int data;
Node right,left;
Node(int data)
{
this.data=data;
right=left=null;
}
}
void insert(int data) {
root = insertRec(root,data);
}
Node insertRec(Node root, int data) {
if (root == null) {
root = new Node(data);
return root;
}
if (data < root.data)
root.left = insertRec(root.left, data);
else if (data > root.data)
root.right = insertRec(root.right, data);
return root;
}
void printLevelOrder()
{
int h = height(root);
int i;
for (i=1; i<=h; i++)
printGivenLevel(root, i);
}
int height(Node root)
{
if (root == null)
return 0;
else
{
int lheight = height(root.left);
int rheight = height(root.right);
if (lheight > rheight)
return(lheight+1);
else return(rheight+1);
}
}
void printGivenLevel (Node root ,int level)
{
if (root == null)
return;
if (level == 1)
System.out.print(root.data + " ");
else if (level > 1)
{
printGivenLevel(root.left, level-1);
printGivenLevel(root.right, level-1);
}
}
public static void main(String []agrs)
{
levelOrder tree = new levelOrder();
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number of nodes");
int num = sc.nextInt();
System.out.println("Enter nodes");
/*Enter the data nodes in PreOrder or just enter root node first*/
for(int i =0 ; i<num ; i++)
{
tree.insert(sc.nextInt());
}
tree.printLevelOrder();
}
}