求二叉树中节点的最大距离即二叉树中相距最远的两个节点之间的距离

最新推荐文章于 2023-05-01 14:01:00 发布

0802小乌龟

最新推荐文章于 2023-05-01 14:01:00 发布

阅读量834

点赞数

本文链接：https://blog.csdn.net/iris0802/article/details/40142525

版权

 <span style="font-size:18px;">        public static int height(TreeNode t)
	    // postcondition: returns height of tree with root t
		    {
		        if (t == null)
		        {
		            return 0;
		        }
		        else
		        {
		            return 1+Math.max(height(t.left),height(t.right));
		        }
		    }
	   public static int getMaxdis(TreeNode tree){
		   // post: return Max distance of tree
		   if (tree == null) return 0;
		   int lheight = height(tree.left);               
		   int rheight = height(tree.right);
		   int ldiameter = getMaxdis(tree.left);
		   int rdiameter = getMaxdis(tree.right);
		   return Math.max(lheight + rheight,Math.max(ldiameter,rdiameter));
	   }</span>