@@ -0,0 +1,426 @@
+%0A// https://www.hackerrank.com/contests/30-days-of-code/challenges/day-22-binary-search-trees/submissions/code/4760287%0A%0A%09public static int getHeight(Node root)%7B%0A        %0A        if (root == null)%0A            return 0;%0A        %0A        int maxHeight = 0;%0A        maxHeight = Math.max(maxHeight, getHeight(root.left));%0A        maxHeight = Math.max(maxHeight, getHeight(root.right));%0A        %0A        return maxHeight + 1;%0A    %7D%0A

Create Day22-BinarySearchTrees.java