题目: 跟标题一样,给定一颗链树,求二叉树的深度。直接给出代码:
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def TreeDepth(self , pRoot: TreeNode) -> int:
if pRoot == None:
return 0
else:
return max(self.TreeDepth(pRoot.left), self.TreeDepth(pRoot.right))+1