二叉树的深度——Python

#-*- coding:utf-8 -*-
class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None
class Solution:
    def TreeDepth(self, pRoot):
        # write code here
        if pRoot==None:
            return 0
        deep=self.TreeDepth(pRoot.left) if self.TreeDepth(pRoot.left)>self.TreeDepth(pRoot.right) else self.TreeDepth(pRoot.right)
        return deep+1
demo=TreeNode(0)
demo.left=TreeNode(1)
demo.left.left=TreeNode(2)
Solution=Solution()
deep=Solution.TreeDepth(demo)
print(deep)