/**
 * PROBLEM
 * The height of a tree (binary or not) is defined to be the maximum distance from the root node to any leaf node. The
 * tree in Figure 5-2, for example, has a height of 4 because the path from A to F, G, or H involves four nodes. Write
 * a function to calculate the height of an rbitrary binary tree.
 */
public class HeightofaTree{
    private static int treeHeight(Node n){
        if(n==null)return 0;
        return 1+Math.max(treeHeight(n.getLeft()),treeHeight(n.getRight()));
    }
}

/**
 * Created by youweilu on 4/9/17.
 */
public class HeightofaTree{
    private static int treeHeight(Node n){
        if(n==null)return 0;
        return 1+Math.max(treeHeight(n.getLeft()),treeHeight(n.getRight()));
    }
}

--- 
+++ 
@@ -1,5 +1,8 @@
 /**
- * Created by youweilu on 4/9/17.
+ * PROBLEM
+ * The height of a tree (binary or not) is defined to be the maximum distance from the root node to any leaf node. The
+ * tree in Figure 5-2, for example, has a height of 4 because the path from A to F, G, or H involves four nodes. Write
+ * a function to calculate the height of an rbitrary binary tree.
  */
 public class HeightofaTree{
     private static int treeHeight(Node n){
Add problem description of height of tree.
