algorithms/isBalanced.java at master · kjayashr/algorithms · 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

public class Solution {
    public boolean isBalanced(TreeNode A) {
      if(A == null)
      {
          return true;
      }


            int leftH  = maxDepth(A.left);
            int rightH = maxDepth(A.right);

        if((Math.abs( leftH - rightH )  <= 1) && (isBalanced(A.left)) &&  (isBalanced(A.right))) {
            return true;
        }
        else
        {
            return false;
        }


    }

         public int maxDepth(TreeNode root) {
if (root == null) return 0;
return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
}


}(TreeNode A) {

    //base case
      if(A == null)
      {
          return true;
      }

        //calculate length
            int leftH  = maxDepth(A.left);
            int rightH = maxDepth(A.right);
           //difference should be less than 1 and recursievly call balanced functions.
        if((Math.abs( leftH - rightH )  <= 1) && (isBalanced(A.left)) &&  (isBalanced(A.right))) {
            return true;
        }

        else
        {
            return false;
        }


    }


//this helper will be called by every helper function.
  public int maxDepth(TreeNode root) {
if (root == null) return 0;
return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
}

//01/03