Merge pull request #493 from JayH2018/patch-2

source coding is a little complex
2025-07-14 01:16:07 +08:00 · 2018-08-28 06:26:12 -07:00
parent ff9205649b 2dc86b6a04
commit 826e7b55b2
1 changed files with 5 additions and 9 deletions
--- a/DataStructures/Trees/LevelOrderTraversal.java
+++ b/DataStructures/Trees/LevelOrderTraversal.java
@ -37,14 +37,10 @@ public class LevelOrderTraversal
           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 height of larger subtree
+             */
+            return Math.max(height(root.left),height(root.right)) + 1;
        }
    }