能这样复制吗? stack[++p]=root 题目是不是NODE*r,*p,*stack[MAX];?

[redappear]

函数VOID exchange(NODE*root)完成二叉树中左右子树交换
#include"stdio.h"
#include"stdlib.h"
#define MAX 500;
typedef struct node{int key;
struct node*llink,*rlink;
}NODE;
void exchange(NODE*root)
{NODE*r,*p,stack[MAX];
int top=0;
(1)
----------------------;
while(top>0)
{p= (2) ;
------------------------
if(p!=NULL)
{r=p-->rlink;
(3) ;
----------------------------
p-->rlink=r;
(4) =p-->llink ;
-----------------------------
(5) =p-->rlink;
}
}
}
答案(1)stack[++p]=root (2)stack[p--] (3) p-->llink=p-->rlink (4)stack[++p] (5)stack[++p]