-
Notifications
You must be signed in to change notification settings - Fork 1.4k
/
Solution.java
61 lines (56 loc) · 1.43 KB
/
Solution.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
// github.com/RodneyShag
import java.io.*;
import java.util.*;
class Node {
Node left, right;
int data;
Node(int data) {
this.data = data;
left = right = null;
}
}
class Solution {
static void levelOrder(Node root) {
if (root == null) {
return;
}
ArrayDeque<Node> deque = new ArrayDeque(); // use deque as a queue
deque.add(root);
while (!deque.isEmpty()) {
Node n = deque.removeFirst();
System.out.print(n.data + " ");
if (n.left != null) {
deque.addLast(n.left);
}
if (n.right != null) {
deque.addLast(n.right);
}
}
}
public static Node insert(Node root,int data){
if (root == null) {
return new Node(data);
} else {
Node cur;
if (data <= root.data) {
cur = insert(root.left, data);
root.left = cur;
}
else {
cur = insert(root.right, data);
root.right = cur;
}
return root;
}
}
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int T = sc.nextInt();
Node root = null;
while (T-- > 0) {
int data = sc.nextInt();
root = insert(root, data);
}
levelOrder(root);
}
}