普通二叉树关于互换左右树结点的C++代码.pdfVIP

#includeiostream using namespace std; struct Binary_node {//定义一个二叉树结点 int data; Binary_node *left; Binary_node *right; Binary_node(); Binary_node(const int x); }; Binary_node::Binary_node() { left = NULL; right = NULL; } Binary_node::Binary_node(const int x) { data = x; left = NULL; right = NULL; } class Binary_tree { public: Binary_tree(); Binary_tree(Binary_node* original); Binary_node* traverse_copy_change(Binary_node *bt); void traverse(Binary_node *bt); bool empty() const; Binary_node* current_node(); bool create(Binary_node *x,Binary_node* lbt,Binary_node* rbt); void modify(); void dele_tree(Binary_node *bt); private: Binary_node *root; }; void Binary_tree::dele_tree(Binary_node *bt) {// 删除一棵二叉树的函数 if(bt != NULL) { dele_tree(bt-left); dele_tree(bt-right); delete bt; } } void Binary_tree::modify() {//这个函数的作用是修改 root 结点，也就是要求的树替换原来的 Binary_node *hold = root; root = traverse_copy_change(root); dele_tree(hold);//替换后删除原来的 ,释放空间 } Binary_tree::Binary_tree() {//初始化 root = NULL root = NULL; } Binary_tree::Binary_tree(Binary_node* original) {//插入一个 root root =new Binary_node; root = original; } bool Binary_tree::empty() const {//判断二叉树是否为空的函数 if(root == NULL) return true; else return false; } Binary_node* Binary_tree::current_node() {//返回 root 函数 return root; } Binary_node* Binary_tree::traverse_copy_change(Binary_node *bt) {//这是主体函数，生成一棵题目要求的二 叉 Binary_node *temp; if(bt == NULL) return NULL; temp = new Binary_node;//先复制根结点 temp-data = bt-data; temp-left = traverse_copy_change(bt-right);//把原来二叉树的右子树复制到新二叉树的左子树处 temp-right = traverse_copy_change(bt-left);//把原来二叉树的左子树复制到新二叉树的右子树处 return temp; } void Binary_tree::traverse(Binary_node *bt) {// 先序遍历打印二叉树数据 if(bt != NULL) { coutbt-data ; traverse(bt-left); traverse(bt-r