-
Notifications
You must be signed in to change notification settings - Fork 1
/
DayTwentyThree.cs
78 lines (73 loc) · 1.85 KB
/
DayTwentyThree.cs
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
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace HackerRank30Day
{
class DayTwentyThree
{
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;
}
}
static void Main(String[] args)
{
Node root = null;
int T = Int32.Parse(Console.ReadLine());
while (T-- > 0)
{
int data = Int32.Parse(Console.ReadLine());
root = insert(root, data);
}
levelOrder(root);
}
static void levelOrder(Node root)
{
//Write your code here
Queue<Node> queue = new Queue<Node>();
queue.Enqueue(root);
while (queue.Count > 0)
{
Node current = queue.Dequeue();
Console.Write(current.data + " ");
if (current.left != null)
{
queue.Enqueue(current.left);
}
if (current.right != null)
{
queue.Enqueue(current.right);
}
}
}
}
class Node
{
public Node left, right;
public int data;
public Node(int data)
{
this.data = data;
left = right = null;
}
}
}