交换二叉树的左子树和右子树

#include <stdio.h>

typedef struct BiTNode {
	int data;
	struct BiTNode *lchild, *rchlid;
}BiTNode,*BiTree;

bool ChangLR(BiTree T)
{
	if (T->lchild == NULL && T->rchlid == NULL)
	{
		return false;
	}
	else   //交换当前左右子树
	{
		BiTree temp;
		temp = T->lchild;
		T->lchild = T->rchlid;
		T->rchlid = temp;
	}
	ChangLR(T->lchild);
	ChangLR(T->rchlid);
}