source coding is a little complex

JayH2018 · web-flow · commit 28deddd5d780 · 2018-08-28T14:36:56.000+08:00
diff --git a/DataStructures/Trees/LevelOrderTraversal.java b/DataStructures/Trees/LevelOrderTraversal.java
@@ -37,14 +37,10 @@ int height(Node root)
            return 0;
         else
         {
-            /* compute  height of each subtree */
-            int lheight = height(root.left);
-            int rheight = height(root.right);
-             
-            /* use the larger one */
-            if (lheight > rheight)
-                return(lheight+1);
-            else return(rheight+1); 
+            /**
+             * return the larger one;
+             */
+            return Math.max(height(root.left),height(root.right)) + 1;
         }
     }
  
@@ -75,4 +71,4 @@ public static void main(String args[])
        System.out.println("Level order traversal of binary tree is ");
        tree.printLevelOrder();
     }
-}
+}

Original file line number	Diff line number	Diff line change
`@@ -37,14 +37,10 @@ int height(Node root)`
`37`	`37`	`return 0;`
`38`	`38`	`else`
`39`	`39`	`{`
`40`		`- /* compute height of each subtree */`
`41`		`- int lheight = height(root.left);`
`42`		`- int rheight = height(root.right);`
`43`		`-`
`44`		`- /* use the larger one */`
`45`		`- if (lheight > rheight)`
`46`		`- return(lheight+1);`
`47`		`- else return(rheight+1);`
	`40`	`+ /**`
	`41`	`+ * return the larger one;`
	`42`	`+ */`
	`43`	`+ return Math.max(height(root.left),height(root.right)) + 1;`
`48`	`44`	`}`
`49`	`45`	`}`
`50`	`46`
`@@ -75,4 +71,4 @@ public static void main(String args[])`
`75`	`71`	`System.out.println("Level order traversal of binary tree is ");`
`76`	`72`	`tree.printLevelOrder();`
`77`	`73`	`}`
`78`		`-}`
	`74`	`+}`