[LeetCode] Diameter of Binary Tree 二叉树的直径

标签：example   this   compute   nod   leetcode   bin   tco   binary   his   

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

s

[LeetCode] Diameter of Binary Tree 二叉树的直径

标签：example   this   compute   nod   leetcode   bin   tco   binary   his   

原文地址：http://www.cnblogs.com/grandyang/p/6607318.html