二叉树编程实战C语言描述

二叉树编程实战
拷贝二叉树.c

二叉树编程实战_拷贝二叉树.c
#define _CRT_SECURE_NO_WARNINGS
#include
#include
#include
//二叉树结点
typedef struct BINARYNODE
{char ch;struct BINARYNODE*lchild;struct BINARYNODE*rchild;
}BinaryNode;
//遍历二叉树
void Recursion(BinaryNode*root)
{if (root &＃61;&＃61; NULL){return;}printf("%c ",root->ch);//遍历左子树Recursion(root->lchild);//遍历右子树Recursion(root->rchild);
}
//拷贝二叉树
BinaryNode*CopyBinaryTree(BinaryNode*root)
{if (root &＃61;&＃61; NULL){return NULL;}//拷贝左子树BinaryNode*lchild &＃61; CopyBinaryTree(root->lchild);//拷贝左子树BinaryNode*rchild &＃61; CopyBinaryTree(root->rchild);//创建结点BinaryNode*newnode &＃61; (BinaryNode*)malloc(sizeof(BinaryNode));newnode->ch &＃61; root->ch;newnode->lchild &＃61; lchild;newnode->rchild &＃61; rchild;return newnode;
}
//释放二叉树内存
void FreeSpaceBinaryTree(BinaryNode*root)
{if (root &＃61;&＃61; NULL){return;}//释放左子树FreeSpaceBinaryTree(root->lchild);//释放右子树FreeSpaceBinaryTree(root->rchild);//释放当前结点free(root);
}
void CresteBinaryTree()
{//创建结点BinaryNode node1 &＃61; { &＃39;A&＃39;,NULL,NULL };BinaryNode node2 &＃61; { &＃39;B&＃39;,NULL,NULL };BinaryNode node3 &＃61; { &＃39;C&＃39;,NULL,NULL };BinaryNode node4 &＃61; { &＃39;D&＃39;,NULL,NULL };BinaryNode node5 &＃61; { &＃39;E&＃39;,NULL,NULL };BinaryNode node6 &＃61; { &＃39;F&＃39;,NULL,NULL };BinaryNode node7 &＃61; { &＃39;G&＃39;,NULL,NULL };BinaryNode node8 &＃61; { &＃39;H&＃39;,NULL,NULL };//建立结点关系node1.lchild &＃61; &node2;node1.rchild &＃61; &node6;node2.rchild &＃61; &node3;node3.lchild &＃61; &node4;node3.rchild &＃61; &node5;node6.rchild &＃61; &node7;node7.lchild &＃61; &node8;BinaryNode*root&＃61; CopyBinaryTree(&node1);Recursion(root);FreeSpaceBinaryTree(root);
}
int main()
{CresteBinaryTree();return EXIT_SUCCESS;
}