一棵排序二叉树，令 f=(最大值+最小值)/2， 设计一个算法，找出距离f 值最近、大于f 值的结点。 复杂度如果是O(n2)则不得分

RT

typedef struct BinTreeNode { int data; struct BinTreeNode *pLeft; struct BinTreeNode *pRight; }*pBinTreeNode; BinTreeNode* GetCloseNode(BinTreeNode* root,int mid) { BinTreeNode* node = NULL; if(NULL==root) return NULL; if(mid>=root->data) node = GetCloseNode(root->pRight,mid); else node = GetCloseNode(root->pLeft,mid); return node == NULL? root:node; } int FindCloseNode(BinTreeNode* root) { if(NULL==root) return NULL; BinTreeNode* left = root; while(NULL!=left->pLeft) left=left->pLeft; BinTreeNode* right = root; while(NULL!=right->pRight) right=right->pRight; int min = left->data; int max = right->data; int mid = (min+max)/2; BinTreeNode* closer = GetCloseNode(root,mid); return closer->data; }