@@ -0,0 +1,319 @@
+//https://www.hackerrank.com/challenges/tree-height-of-a-binary-tree%0A%0A/* You only have to complete the function given below.%0A    class Node %7B%0A        int data;%0A        Node left;%0A        Node right;%0A    %7D%0A*/%0A%0Aint height(Node root)%7B%0A    return (root == null) ? 0 : 1 + Math.max(height(root.left), height(root.right));%0A%7D%0A

Create tree-height-of-a-binary-tree.java