leftData = process(head.left);
Data rightData = process(head.right);
return new Data(Math.max...(Math.max(leftData.max,rightData.max),head.value),
Math.min(Math.min(leftData.min...(Math.max(leftSize,rightSize),includeHeadSize);
Node maxHead = leftSize > rightSize ?...(Math.max(leftMax,rightMax),head.value));
}
}
3.求一棵二叉树上的最远距离
二叉树中,一个节点可以往上走和往下走,那么从节点A总能走到结点B,结点...(Math.max(leftDistance,rightDistance),includeHeadDistace);
int maxH = Math.max(leftData.h,rightData.h