change depth to height

problems/0104.二叉树的最大深度.md

@@ -402,10 +402,10 @@ class solution:
     def getdepth(self, node):
         if not node:
             return 0
-        leftdepth = self.getdepth(node.left) #左
+        leftheight = self.getdepth(node.left) #左
-        rightdepth = self.getdepth(node.right) #右
+        rightheight = self.getdepth(node.right) #右
-        depth = 1 + max(leftdepth, rightdepth) #中
+        height = 1 + max(leftheight, rightheight) #中
-        return depth
+        return height
 ```
 
 递归法：精简代码