python leetcode 55

python-leetcode/README.md

@@ -8,3 +8,4 @@
 ## 二叉树专题
 
 1. [二叉树的镜像](./solution/tree/leetcode_27_.py)
+1. [二叉树的深度](./solution/tree/leetcode_55_.py)

python-leetcode/solution/tree/leetcode_55_.py

+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+# coding=utf-8
+"""
+27. 二叉树的镜像
+"""
+from solution import TreeNode
+
+
+class Solution:
+    def maxDepth(self, root: TreeNode) -> int:
+        if root is None:
+            return 0
+        leftDepth = self.maxDepth(root.left) + 1
+        rightDepth = self.maxDepth(root.right) + 1
+        return leftDepth if leftDepth > rightDepth else rightDepth