-
Notifications
You must be signed in to change notification settings - Fork 13
/
BST_InsertNodeInBST.java
88 lines (73 loc) · 2.13 KB
/
BST_InsertNodeInBST.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
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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.Queue;
// https://practice.geeksforgeeks.org/problems/insert-a-node-in-a-bst/1
// https://www.geeksforgeeks.org/binary-search-tree-set-1-search-and-insertion/
public class BST_InsertNodeInBST {
private static Node insert(Node root, int key) {
if(root == null) return null;
if(key < root.data) {
if(root.left == null) root.left = new Node(key);
else insert(root.left, key);
}
else if(key > root.data) {
if(root.right == null) root.right = new Node(key);
else insert(root.right, key);
}
return root;
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int t = Integer.parseInt(br.readLine().trim());
while(t-->0) {
String ip = br.readLine().trim();
int key = Integer.parseInt(br.readLine().trim());
Node root = buildTree(ip);
Node rootAfterInsertion = insert(root, key);
inorder(rootAfterInsertion);
System.out.println();
}
}
private static void inorder(Node root)
{
if(root==null) return;
inorder(root.left);
System.out.print(root.data + " ");
inorder(root.right);
}
private static Node buildTree(String str) {
if(str.length()==0 || str.charAt(0)=='N') return null;
String ip[] = str.split("\\s+");
Node root = new Node(Integer.parseInt(ip[0]));
Queue<Node> queue = new LinkedList<>();
queue.add(root);
int i = 1;
while(queue.size() > 0 && i < ip.length) {
Node currNode = queue.poll();
String currData = ip[i];
if(!currData.equals("N")) {
currNode.left = new Node(Integer.parseInt(currData));
queue.add(currNode.left);
}
i++;
if(i >= ip.length) break;
currData = ip[i];
if(!currData.equals("N")) {
currNode.right = new Node(Integer.parseInt(currData));
queue.add(currNode.right);
}
i++;
}
return root;
}
private static class Node {
private int data;
private Node left, right;
Node(int data) {
this.data = data;
left = right = null;
}
}
}