今�Hの国の呵呵君: [Algorithm]Get Max Distance in Binary Tree
[Algorithm]Get Max Distance in Binary Tree
Distance定义为从一个节点到另一个节点经过的edge的数量,这一题其实跟max sum in bianry tree类似,返回左右子树的最深距离,然后相加看要不要更新返回值,然后去左和右的最大值加一return。代码如下:
Read full article from 今�Hの国の呵呵君: [Algorithm]Get Max Distance in Binary Tree
No comments:
Post a Comment