C语言树拷贝的过程分析

 1

struct BinaryNode
{
    char ch; // 数据域
    struct BinaryNode *lChild;  //左子树
    struct BinaryNode *rChild;  //右子树
};

//拷贝树 
 2 struct BinaryNode * copyTree(struct BinaryNode * root)
 3 {
 4     if (root ==NULL)
 5     {
 6         return NULL;
 7     }
 8 
 9     //先拷贝 左子树
10     struct BinaryNode * lChild = copyTree(root->lChild);
11 
12     //再拷贝 右子树
13     struct BinaryNode * rChild = copyTree(root->rChild);
14 
15     //创建新的节点
16     struct BinaryNode * newNode = malloc(sizeof(struct BinaryNode));
17 
18     newNode->lChild = lChild;
19     newNode->rChild = rChild;
20 
21     newNode->ch = root->ch;
22 
23     return newNode;
24 
25 }