首页 > 其他 > 详细

543. Diameter of Binary Tree(两节点的最长路径)

时间:2019-03-20 11:52:16      阅读:154      评论:0      收藏:0      [点我收藏+]

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.

 

方法一:递归

此问题在104题基础上求最短路径

技术分享图片

 

543. Diameter of Binary Tree(两节点的最长路径)

原文:https://www.cnblogs.com/shaer/p/10563931.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!