-
Notifications
You must be signed in to change notification settings - Fork 0
/
a_163_Valid_Mirror.java
95 lines (73 loc) · 2.08 KB
/
a_163_Valid_Mirror.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
public class a_163_Valid_Mirror {
static class Node{
int data ;
Node left;
Node right ;
Node(int data){
this.data = data ;
}
}
public static Node insert(Node root, int val){
if(root == null){
root = new Node(val) ;
return root ;
}
if(root.data > val){
// Left subtree
root.left = insert(root.left, val) ;
}
else{
// Right subtree
root.right = insert(root.right, val) ;
}
return root ;
}
public static void inOrder(Node root){
if(root == null){
return ;
}
inOrder(root.left);
System.out.print(root.data +" ");
inOrder(root.right);
}
public static boolean isValidBST(Node root, Node min, Node max){
if(root == null){
return true ;
}
if(min != null && root.data <= min.data){
return false ;
}
else if(max != null && root.data >= max.data){
return false ;
}
return isValidBST(root.left, min, root) && isValidBST(root.right, root, max);
}
public static Node mirror(Node root){
if(root == null){
return null ;
}
Node leftMirror = mirror(root.left) ;
Node rightMirror = mirror(root.right) ;
root.left = rightMirror ;
root.right = leftMirror ;
return root ;
}
public static void main(String[] args) {
// Valid BST
// Mirror BST
int values[] = {8, 5, 3, 6, 10, 11, 14 } ;
Node root = null ;
for(int i=0; i<values.length ; i++){
root = insert(root, values[i]) ;
}
inOrder(root) ;
System.out.println();
// if( isValidBST(root, null, null) ){
// System.out.println("valid :) ");
// }
// else{
// System.out.println("Not valid :) ");
// }
mirror(root) ;
}
}