Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 05bf50e

Browse files
NicolasNicolas
Nicolas
authored and
Nicolas
committed
Solution 0104 Maximum Depth of Binary Tree
1 parent c399196 commit 05bf50e

File tree

1 file changed

+12
-0
lines changed

1 file changed

+12
-0
lines changed
Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
# Definition for a binary tree node.
2+
# class TreeNode:
3+
# def __init__(self, val=0, left=None, right=None):
4+
# self.val = val
5+
# self.left = left
6+
# self.right = right
7+
class Solution:
8+
def maxDepth(self, root: TreeNode) -> int:
9+
if root==None:
10+
return 0
11+
else:
12+
return max(self.maxDepth(root.left),self.maxDepth(root.right))+1

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /