创造二叉排序树  第一个地址 和第二个的差值 和后面的不一样？
struct node *create()
{struct node *p,*r,*b,*f;
b=(struct node*)malloc(sizeof(struct node));
printf("input the nums of tree:(input -1 to stop)\n");
scanf("%d",&b->data);
b->lc=NULL;
b->rc=NULL;
r=NULL;
n=0;
while(b->data!=-1)
{n=n+1;
  if(n==1){r=b;p=r;}
  else {while(p!=NULL)
    {if(b->data<p->data) {f=p;p=p->lc;}
     else {f=p;p=p->rc;}
    }
       }
  f=b;
  p=r;
  printf("p_value:%ld\n",f);
  b=(struct node*)malloc(sizeof(struct node));
  scanf("%d",&b->data);
}
return(r);
free(b);
}
void main()
{struct node *r;
printf("now ,start to create the tree:\n");
r=create();
}

Sorry!
node 你没给代码，
n没有定义

创造二叉排序树  第一个地址 和第二个的差值 和后面的不一样？
#include<stdio.h>
struct node
{int data;
 struct node *lc;
 struct node *rc;
};
int n;

struct node *create()
{struct node *p,*r,*b,*f;
 b=(struct node*)malloc(sizeof(struct node));
 printf("input the nums of tree:(input -1 to stop)\n");
 scanf("%d",&b->data);
 b->lc=NULL;
 b->rc=NULL;
 r=NULL;
 n=0;
while(b->data!=-1)
 {n=n+1;
  if(n==1){r=b;p=r;}
  else {while(p!=NULL)
    {if(b->data<p->data) {f=p;p=p->lc;}
     else {f=p;p=p->rc;}
    }
       }
  f=b;
  p=r;
  printf("p_value:%ld\n",f);
  b=(struct node*)malloc(sizeof(struct node));
  scanf("%d",&b->data);
 }
 return(r);
 free(b);
}

还是一样的结果，不行啊

#include <stdio.h>
#include <malloc.h>

struct node
{
    int            data;
    struct node *lc;
    struct node *rc;
};

int n;

struct node *create()
{
    struct node *p, *r, *b, *f;
    b = (struct node*)malloc(sizeof(struct node));
    printf("input the nums of tree:(input -1 to stop)\n");
    scanf("%d", &b->data);
    b->lc = NULL;
    b->rc = NULL;
    r = NULL;
    n = 0;
    while(b->data != -1)
    {
        n = n + 1;
        if(n == 1)
        {
            r = b;
            p = r;
        }
        else 
        {
            while(p != NULL)
            {
                if(b->data < p->data) 
                {
                    f = p;
                    p = p->lc;
                }
                else 
                {
                    f = p;
                    p = p->rc;
                }
            }
        }
        f = b;
        p = r;
        printf("p_value:%ld\n", f->data);/*这里我修改的.你运行一下看看是不是你想要的结果*/
        b = (struct node*)malloc(sizeof(struct node));
        scanf("%d", &b->data);
    }
    return(r);
    free(b);
}

void main()
{
    struct node *r;
    printf("now ,start to create the tree:\n");
    r = create();
}

题意 是输出指针值。。刚才赶了一下，加 注释
#include<stdio.h>
struct node
{int data;
 struct node *lc;
 struct node *rc;
};
int n;

struct node *create()
{struct node *p,*r,*b,*f;/*r为根结点,b为要插入的结点，p为扫面指针，f用于保存p*/
 b=(struct node*)malloc(sizeof(struct node));/*开辟一个新结点*/
 printf("input the nums of tree:(input -1 to stop)\n");
 scanf("%d",&b->data);
 b->lc=NULL;
 b->rc=NULL;
 r=NULL;/*对r初始化*/
 n=0;
while(b->data!=-1)/*当输入-1时t时结束循环*/
 {n=n+1;
  if(n==1){r=b;p=r;}/*使 第一次输入的作为根结点*/
  else {while(p!=NULL)
    {if(b->data<p->data) {f=p;p=p->lc;}
     else {f=p;p=p->rc;}/*用f保存p，p再 指向下一个*/
    }
       }
  f=b;/*f就是指向输入的结点*/
  p=r;/*使p重新回到根结点*/
  printf("p_value:%ld\n",f);/*打印插入结点的指针值*/
  b=(struct node*)malloc(sizeof(struct node));
  scanf("%d",&b->data);/*再次输入一个新的结点*/
 }
 return(r);
 free(b);
}
void main()
{struct node *r;
 printf("now ,start to create the tree:\n");
 r=create();
}

[[it] 本帖最后由 jinxilee 于 2008-4-20 10:54 编辑 [/it]]

帮帮忙啊！