牛客网 二叉树的深度

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def TreeDepth(self, pRoot):
        if not pRoot:
            return 0
        ans=self.TreePath(pRoot)
        # 获取长度
        length=0
        for i in ans:
            if length<len(i):
                length=len(i)
        return length

    def TreePath(self,pRoot):
        if not pRoot:
            return []
        if pRoot and not pRoot.left and not pRoot.right:
            return [[pRoot.val]]

        ans=[]
        left=self.TreePath(pRoot.left)
        right=self.TreePath(pRoot.right)
        for i in left+right:
            ans.append([pRoot.val]+i)

        return ans