int maxDistance(Node* root) {
intdepth;
return helper(root, depth);
}
int helper(Node *root, int &depth) {
if(root == NULL) {
depth = 0; return 0;
}
intld, rd;
intmaxleft = helper(root->left, ld);
intmaxright = helper(root->right, rd);
depth = max(ld, rd)+1;
return max(maxleft, max(maxright, ld+rd));
}
求二叉树中节点的最大距离
最新推荐文章于 2018-09-20 12:40:16 发布