- 试设计一个递归算法,判断二叉树T是否是满二叉树,假设T是以二叉链表存储。
typedef struct BTNode{
int data;
struct BTNode *lchild , *rchild;
}BTNode;
int isFullTree(BTNode *bt , int &depth){
int ldepth , rdepth;
if(bt == NULL){
depth = 0;
return 1;
}
if(isFullTree(bt->lchild , ldepth) == 0) return 0;
if(isFullTree(bt->rchild , rdepth) == 0) return 0;
if(ldepth != rdepth) return 0;
depth = ldepth + 1;
return 1;
}
- 设一棵二叉树以二叉链表表示,试编写一算法统计二叉树的宽度,即在二叉树的各层上,求出具有结点数最多的那一层上的结点总数。
typedef struct BTNode{
int data;
int layer;
struct BTNode *lchild , *rchild;
}BTNode;
int getWidth(BTNode *bt){
if(bt == NULL)
return 0;
BTNode* queue[maxSize];
int front = 0 , rear = 0;
int width[maxSize] , maxWidth = 0;
int maxLayer = 0;
BTNode *p = NULL;
bt->layer = 1;
queue[++rear] = bt;
while(front != rear){
front = (front + 1) % maxSize;
p = queue[front];
++width[p->layer];
maxLayer = p->layer;
if(p->lchild != NULL){
rear = (rear + 1) % maxSize;
p->lchild->layer = p->layer + 1;
queue[rear] = p->lchild;
}
if(p->rchild != NULL){
rear = (rear + 1) % maxSize;
p->rchild->layer = p->layer + 1;
queue[rear] = p->rchild;
}
}
for(int i = 1 ; i <= maxLayer ; ++i){
if(width[i] > maxWidth)
maxWidth = width[i];
}
return maxWidth;
}
- 假设一棵树的存储结构采用双亲表示法,双亲数组为int parent[MaxSize],其中MaxSize为最大结点个数。树中各结点按先根遍历的次序存放,根结点存于parent[0]。试编写一个函数,计算下标p所指结点和下标q所指结点的最近公共祖先结点。
int NearAncestor(int parent[] , int p , int q){
int i , j;
for(i = p ; i != -1 ; i = parent[i]){
for(j = q ; j != -1 ; j = parent[j])
if(i == j)
return i;
}
}