We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 28deddd commit 2dc86b6Copy full SHA for 2dc86b6
DataStructures/Trees/LevelOrderTraversal.java
@@ -38,7 +38,7 @@ int height(Node root)
38
else
39
{
40
/**
41
- * return the larger one;
+ * Return the height of larger subtree
42
*/
43
return Math.max(height(root.left),height(root.right)) + 1;
44
}
0 commit comments