使用C++構(gòu)建一個(gè)二叉樹(shù)并復(fù)制、輸出。

程序

#include 
#include 
//#include 
#include 
#include
#include  
#include

#include 
using namespace std;



struct TreeNode          // 定義二叉樹(shù)
{
    int val;                       // 當(dāng)前節(jié)點(diǎn)值用val表示
    struct TreeNode *left;     // 指向左子樹(shù)的指針用left表示
    struct TreeNode *right;    // 指向右子樹(shù)的指針用right表示
    TreeNode(int x) :val(x), left(NULL), right(NULL) { } // 初始化當(dāng)前結(jié)點(diǎn)值為x，左右子樹(shù)為空
};


//創(chuàng)建樹(shù)
TreeNode* insert(TreeNode* tree, int value)
{
    
    TreeNode* node = (TreeNode*)malloc(sizeof(TreeNode)); // 創(chuàng)建一個(gè)節(jié)點(diǎn)
    node->val = value;      // 初始化節(jié)點(diǎn)                            // malloc函數(shù)可以分配長(zhǎng)度
    node->left = NULL;
    node->right = NULL;

    TreeNode* temp = tree;      // 從樹(shù)根開(kāi)始
    while (temp != NULL)
    {
        if (value < temp->val)  // 小于根節(jié)點(diǎn)就進(jìn)左子樹(shù)
        {
            if (temp->left == NULL)
            {
                temp->left = node;  // 新插入的數(shù)為temp的左子樹(shù)
                return tree;
            }
            else           // 下一輪判斷
                temp = temp->left;
        }
        else           // 否則進(jìn)右子樹(shù)
        {    

            if (temp->right == NULL)
            {
                temp->right = node;  // 新插入的數(shù)為temp的右子樹(shù)
                return tree;
            }
            else           // 下一輪判斷
                temp = temp->right;
        }
    }
    return tree;
}
 
//  ************* 輸出圖形二叉樹(shù) *************
void output_impl(TreeNode* n, bool left, string const& indent)
{
    if (n->right)
    {
        output_impl(n->right, false, indent + (left ? "|     " : "      "));
    }
    cout << indent;
    cout << (left ? '\\' : '/');
    cout << "-----";
    cout << n->val << endl;
    if (n->left)
    {
        output_impl(n->left, true, indent + (left ? "      " : "|     "));
    }
}
void output(TreeNode* root)
{
    if (root->right)
    {
        output_impl(root->right, false, "");
    }
    cout << root->val << endl;
    if (root->left)
    {
        output_impl(root->left, true, "");
    }
    system("pause");
}
//  ******************************************



void CopyBiTree(TreeNode* root, TreeNode* newroot) //  復(fù)制二叉樹(shù)
{
    if (root == nullptr)
        return;
    else
    {
        newroot->val = root->val;
        if (root->left != nullptr)
            newroot->left = new TreeNode(0);
        if (root->right != nullptr)
            newroot->right = new TreeNode(0);

        CopyBiTree(root->left, newroot->left);
        CopyBiTree(root->right, newroot->right);
    }
    //output(newroot);
}


// ====================測(cè)試代碼====================
int main()
{
    TreeNode* tree =new TreeNode(10);       // 樹(shù)的根節(jié)點(diǎn)
    TreeNode* treeresult;

    treeresult = insert(tree, 6);         // 輸入n個(gè)數(shù)并創(chuàng)建這個(gè)樹(shù)
    treeresult = insert(tree, 4);
    treeresult = insert(tree, 8);
    treeresult = insert(tree, 14);
    treeresult = insert(tree, 12);
    treeresult = insert(tree, 16);

    TreeNode* mirroot = new TreeNode(10);
    CopyBiTree(treeresult, mirroot); //  復(fù)制二叉樹(shù)
    output(treeresult);         //  輸出原二叉樹(shù)
    output(mirroot);         //  輸出復(fù)制的二叉樹(shù)


}

結(jié)果

審核編輯：湯梓紅