543. Diameter of Binary Tree

题目描述

543. Diameter of Binary Tree

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].

Note: The length of path between two nodes is represented by the number of edges between them.

思想

求二叉树的直径，即树中两个相距最远的节点间的距离。节点左/右儿子的高度L/R之和即为经过该节点的直径。

递归地（深度优先遍历）

- 沿某节点左/右两儿子的路径访问直至叶节点的路径长（左/右儿子的高度）记作L和R，该节点自身高度为max(L,R)+1，将每个节点的L与R相加即可得到经过该节点的直径，树中所有节点的最大值即为所求。

在求深度的递归函数中顺便就把直径算出来。

答案

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def diameterOfBinaryTree(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        # 定义全局变量，保存当前找到的最大直径
        self.ans = 0
        # 定义子方法，计算每个节点的高度
        def height(node):
            if not node:
                return 0
            L = height(node.left)
            R = height(node.right)
            self.ans = max(self.ans, L+R)
            return max(L,R)+1
        height(root)
        return self.ans