Runtime: 1 ms (Top 65.91%) | Memory: 42.9 MB (Top 74.91%)

Author: AnasImloul

scripts/algorithms/D/Diameter of Binary Tree/Diameter of Binary Tree.java

@@ -1,3 +1,4 @@
+// Runtime: 1 ms (Top 65.91%) | Memory: 42.9 MB (Top 74.91%)
 class Solution {
     // Declare Global Variable ans to 0
     int ans = 0;
@@ -8,14 +9,13 @@ public int dfs(TreeNode root) {
         int lh = dfs(root.left);
         // recursive call for right height
         int rh = dfs(root.right);
-        
+
         // update ans
         ans = Math.max(ans, lh + rh);
-        
+
         // return max value
         return Math.max(lh, rh) + 1;
     }
-    
 
     // Diameter of Binary Tree Function
     public int diameterOfBinaryTree(TreeNode root) {
@@ -36,4 +36,4 @@ public int diameterOfBinaryTree(TreeNode root) {
 /*
 Time - O(n)
 Space - O(n)
-*/
+*/