输入一棵二元查找树, 将该树转换为它的镜像

要求使用递归和循环两种方法.

二叉树节点定义:

typedef struct BSTreeNode{
int m_nValue;
struct BSTreeNode * m_pLeft;
struct BSTreeNode * m_pRight;
}BSTreeNode;

一.递归

void reverseBTree(BSTreeNode * bstree)
{
BSTreeNode * pnode;

if(bstree)
{
reverseBTree(bstree->m_pLeft);