Lintcode 1181. Diameter of Binary Tree (Easy) (Python)

1181. Diameter of Binary Tree

Description:

Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.

Example
Given a binary tree
1
/ \
2 3
/ \
4 5
Return 3, which is the length of the path [4,2,1,3] or [5,2,1,3].

Code:

"""
Definition of TreeNode:
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None
"""

class Solution:
    """
    @param root: a root of binary tree
    @return: return a integer
    """
    def lenTree(self, root):
        if root == None:
            return 0
        lenl = self.lenTree(root.left)
        lenr = self.lenTree(root.right)
        return max(lenl, lenr)+1

    def diameterOfBinaryTree(self, root):
        # write your code here
        return self.lenTree(root.left)+self.lenTree(root.right)