basic-dsa-problems-in-java/BinaryArrayTree.java at main · MeeraSRaj/basic-dsa-problems-in-java · GitHub

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
package project;

public class BinaryArrayTree{
    public void inorder(int arr[], int i) {
        int n=arr.length;
        if (i >= n || arr[i] == -1) {
            return;
        }
        inorder(arr, 2 * i + 1);
        System.out.print(arr[i] + " ");
        inorder(arr, 2 * i + 2);
    }

    public void preorder(int arr[],  int i) {
        int n=arr.length;
        if (i >= n || arr[i] == -1) {
            return;
        }
        System.out.print(arr[i] + " ");
        preorder(arr, 2 * i + 1);
        preorder(arr, 2 * i + 2);
    }

    public void postorder(int arr[], int i) {
        int n=arr.length;
        if (i >= n || arr[i] == -1) {
            return;
        }
        postorder(arr, 2 * i + 1);
        postorder(arr, 2 * i + 2);
        System.out.print(arr[i] + " ");
    }

    private void traversal(int arr[], int n, int i, int[] result) {
        if (i >= n || arr[i] == -1) {
            return;
        }

        if (arr[i] > result[0]) {
            result[0] = arr[i];
        }
        if (arr[i] < result[1]) {
            result[1] = arr[i];
        }

        traversal(arr, n, 2 * i + 1, result);
        traversal(arr, n, 2 * i + 2, result);
    }

    public int findMax(int arr[], int n, int i, boolean bst) {
        if (bst == true) {
            while (2 * i + 2 < n && arr[2 * i + 2] != -1) {
                i = 2 * i + 2;
            }
            return arr[i];
        } else {
            int[] result = {Integer.MIN_VALUE, Integer.MAX_VALUE};
            traversal(arr, n, 0, result);
            return result[0];
        }
    }
    public int findMin(int arr[], int n, int i, boolean bst) {
        if (bst == true) {
            while (2 * i + 1 < n && arr[2 * i + 1] != -1) {
                i = 2 * i + 1;
            }
            return arr[i];
        } else {
            int[] result = {Integer.MIN_VALUE, Integer.MAX_VALUE};
            traversal(arr, n, 0, result);
            return result[1];
        }
    }

    public int search(int arr[], int n, int i, int key, boolean bst) {
        if (bst == true) {
            if (i >= n || arr[i] == -1) {
                return -1;
            }
            if (arr[i] == key) {
                return i;
            }
            int left = search(arr, n, 2 * i + 1, key, bst);
            if (left != -1) {
                return left;
            }
            int right = search(arr, n, 2 * i + 2, key, bst);
            return right;
        }
        else {
            while (i < n && arr[i] != -1) {
                if (key == arr[i]) {
                    return i;
                }
                else if (key < arr[i]) {
                    i = 2 * i + 1;
                }
                else {
                    i = 2 * i + 2;
                }
            }
            return -1;
        }
    }

    private boolean isBSTUtil(int arr[], int n, int i, int min, int max) {
        if (i >= n || arr[i] == -1) {
            return true;
        }
        if (arr[i] < min || arr[i] > max) {
            return false;
        }
        return isBSTUtil(arr, n, 2 * i + 1, min, arr[i] - 1) &&
               isBSTUtil(arr, n, 2 * i + 2, arr[i] + 1, max);
    }

    public boolean isBST(int arr[], int n, int i){
        return isBSTUtil(arr, n, i, Integer.MIN_VALUE, Integer.MAX_VALUE);
    }
}