543. Diameter of Binary Tree

最新推荐文章于 2025-09-11 18:44:42 发布

weixin_30784501

最新推荐文章于 2025-09-11 18:44:42 发布

阅读量42

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/wzj4858/p/7707232.html

本文介绍了一种计算二叉树直径的方法，即树中任意两点间最长路径的长度，该路径可能穿过根节点也可能不穿过。通过递归计算每个节点的最大深度来找到整个树的最大直径。

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

Return 3, which is the length of the path [4,2,1,3] or [5,2,1,3].

题目含义：求二叉树的直径，并告诉了我们直径就是两点之间的最远距离。这条直径可以不包含根节点

 1     private int maxLength = 0;
 2     private int maxDepth(TreeNode root)
 3     {
 4         if (root == null)return 0;
 5         int leftMaxDepth = maxDepth(root.left);
 6         int rightMaxDepth = maxDepth(root.right);
 7         maxLength = Math.max(maxLength,leftMaxDepth+rightMaxDepth);
 8         return Math.max(leftMaxDepth,rightMaxDepth)+1;
 9     }    
10     public int diameterOfBinaryTree(TreeNode root) {
11         maxDepth(root);
12         return maxLength;
13     }