数据结构第六章习题答案.doc

{intdata;structnode*lchild,*rchild;};typedefstructnodeNODE;NODE*create_tree(a,i,j)inta[],i,j;{NODE*p;intk;if(i>j)return(NULL);k=(i+j)/2;p=(NODE*)malloc(sizeof(NODE));p->data=a[k];p->lchild=create_tree(a,i,k-1);p->rchild=create_tree(a,k+1,j);return(p);}(root)NODE*root;{intx;if(root==NULL)return(0);if(root->data<root->rchild->data&&root->data>root->lchild->data){x=check(root->rchild);if(!x)return(check(root->lchild));}return(1);}(root)NODE*root;{inth,k;if(root==NULL)return(-1);elseif(root->lchild==NULL&&root->rchild==NULL)return(0);else{h=height(root->lchild);k=height(root->rchild);if(h>k)return(h+1);elsereturn(k+1);}}#include“”intcheck_beltree(root)NODE*root;{inta;if(root==NULL)return(1);if(check_beltree(root->lchild)==0||check_beltree(root->rchild)==0)return(0);a=abs(height(root->rchild)-height(root->lchild));//上题函数if(a<=1)return(1);}+1