forked from profpiyush/Hacktberfest-2021
-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinaryTree.java
166 lines (146 loc) · 5.08 KB
/
BinaryTree.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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
//cpp code for binary tree
public class BinaryTreeUse{
public static BinaryTreeNode<Integer> takeTreeInputBetter(boolean isRoot, int parentData, boolean isLeft){
if(isRoot){
System.out.println("Enter root data");
}
else{
if(isLeft){
System.out.println("Enter left child of "+ parentData);
}
else{
System.out.println("Enter right child of"+ parentData);
}
}
System.out.println("Enter root data");
Scanner s= new Scanner(System.in);
int rootData = s.nextInt();
if(rootData==-1){
return null;
}
BinaryTreeNode<Integer> root= new BinaryTreeNode<Integer>(rootData);
BinaryTreeNode<Integer> leftChild= takeTreeInputBetter(false, rootData, true);
BinaryTreeNode<Integer> rightChild= takeTreeInput(false, rootData, false);
root.left= leftChild;
root.right= rightChild;
return root;
}
public static BinaryTreeNode<Integer> takeTreeInput(){
System.out.println("Enter root data");
Scanner s= new Scanner(System.in);
int rootData = s.nextInt();
if(rootData==-1){
return null;
}
BinaryTreeNode<Integer> root= new BinaryTreeNode<Integer>(rootData);
BinaryTreeNode<Integer> leftChild= takeTreeInput();
BinaryTreeNode<Integer> rightChild= takeTreeInput();
root.left= leftChild;
root.right= rightChild;
return root;
}
public static void printTreeDetailed(BinaryTreeNode<Integer> root){
if(root == null){
return;
}
System.out.println(root.data+":");
if(root.left != null){
System.out.print("L"+root.left.data+", ");
}
if(root.right != null){
System.out.print("R"+root.right.data);
}
printTree(root.left);
printTree(root.right);
}
public static int numNodes(BinaryTreeNode<Integer> root){
if(root==null) return 0;
int leftNodeCount= numNodes(root.left);
int rightNodeCount= numNodes(root.right);
return 1+leftNodeCount+rightNodeCount;
}
public static int largest(BinaryTreeNode<Integer> root){
if(root==null){
return -1;
}
int largestLeft= largest(root.left);
int largestRight= largest(root.right);
return Math.max(root.data, Math.max(largestLeft, largestRight));
}
public static int numLeaves(BinaryTreeNode<Integer> root){
if(root==null){
return 0;
}
if(root.left==null &&root.right==null){
return 1;
}
return numLeaves(root.left)+numLeaves(root.right);
}
public static void printAtDepthK(BinaryTreeNode<Integer> root, int k){
if(root==null){
return;
}
if(k==0){
System.out.println(root.data);
return;
}
printAtDepthK(root.left, k-1);
printAtDepthK(root.right, k-1);
}
public static BinaryTreeNode<Integer> removeLeaves(BinaryTreeNode<Integer> root) {
if(root==null) {
return null;
}
if(root.left==null && root.right==null) {
return null;
}
root.left = removeLeaves(root.left);
root.right = removeLeaves(root.right);
return root;
}
public static int height(root) {
if(root==null) {
return 0;
}
int leftHeight=height(root.left);
int rightHeight=height(root.right);
return 1+ Math.max(leftHeight, rightHeight);
}
//bad time complexity Worst case:- O(n2), avg case:- O(nlogn)
public static boolean isBalanced(BinaryTreeNode<Integer> root) {
if(root==null) {
return true;
}
int leftHeight=height(root.left);
int rightHeight=height(root.right);
if(Math.abs(leftHeight - rightHeight) >1){
return false;
}
boolean isLeftBalanced = isBalanced(root.left);
boolean isRightBalanced = isBalanced(root.right);
return isLeftBalanced && isRightBalanced ;
}
public static void main(String[] args){
// BinaryTreeNode<Integer> root = new BinaryTreeNode<Integer>(1);
//
// BinaryTreeNode<Integer> rootLeft = new BinaryTreeNode<Integer>(2);
// BinaryTreeNode<Integer> rootRight = new BinaryTreeNode<Integer>(3);
// root.left = rootLeft;
// root.right= rootRight;
//
//
// BinaryTreeNode<Integer> twoRight = new BinaryTreeNode<Integer>(4);
// BinaryTreeNode<Integer> threeLeft = new BinaryTreeNode<Integer>(5);
//
// rootLeft.right= twoRight;
// rootRight.left= threeLeft;
//
BinaryTreeNode<Integer> root = takeTreeInputBetter(true, 0, true);
printTreeDetailed(root);
System.out.println("Num nodes "+numNodes(root));
System.out.println("Largest is " + largest(root));
printAtDepthK(root,2)
BinaryTreeNode<Integer> newRoot= removeLeaves(root);
printTreeDetailed(newRoot)
}
}