Improved task 543

Author: ThanhNIT

src/main/python/g0501_0600/s0543_diameter_of_binary_tree/Solution0543.py

@@ -28,7 +28,7 @@ def diameterOfBinaryTree(self, root: Optional[TreeNode]) -> int:
     def diameterOfBinaryTreeUtil(self, root: TreeNode) -> int:
         if root is None:
             return 0
-        leftLength = 1 + self.diameterOfBinaryTreeUtil(root.left) if root.left else 0
-        rightLength = 1 + self.diameterOfBinaryTreeUtil(root.right) if root.right else 0
-        self.diameter = max(self.diameter, leftLength + rightLength)
-        return max(leftLength, rightLength)
+        left_length = 1 + self.diameterOfBinaryTreeUtil(root.left) if root.left else 0
+        right_length = 1 + self.diameterOfBinaryTreeUtil(root.right) if root.right else 0
+        self.diameter = max(self.diameter, left_length + right_length)
+        return max(left_length, right_length)