二叉树(结点释放)

最新推荐文章于 2023-10-17 22:32:51 发布

weixin_33749242

最新推荐文章于 2023-10-17 22:32:51 发布

阅读量605

点赞数 1

文章标签：数据结构与算法

原文链接：https://my.oschina.net/tsh/blog/862912

版权

为什么80%的码农都做不了架构师？>>>

#include <iostream>

struct Node {
    int data;
    struct Node *left;
    struct Node *right;

    Node(int x) {
        data = x;
        left = NULL;
        right = NULL;
    }
};

void PostorderVisitTree(struct Node *root)
{
    if (root == NULL) return;

    PostorderVisitTree(root->left);
    PostorderVisitTree(root->right);
    printf("%d ", root->data);
}

void _delBinTree(struct Node *root)
{
    if (root == NULL) return;
    _delBinTree(root->left);
    _delBinTree(root->right);
    
    printf("Delete Node (data = %d)!\n", root->data);
    delete (root);
    root = NULL;
}

void deleteTree(struct Node **node)
{
    _delBinTree(*node);
    *node = NULL;
}

int main(int argc, char** argv) 
{
    Node *root = new Node(1);
    root->left = new Node(3);
    root->left->left = new Node(2);
    root->left->right = new Node(1);
    root->left->right->left = new Node(1);
    root->right = new Node(-1);
    root->right->left = new Node(4);
    root->right->left->left = new Node(1);
    root->right->left->right = new Node(2);
    root->right->right = new Node(5);
    root->right->right->right = new Node(2);

    PostorderVisitTree(root);
    printf("\n");

    deleteTree(&root);
    return 0;
}

输出结果：

2 1 1 3 1 2 4 2 5 -1 1 
Delete Node (data = 2)!
Delete Node (data = 1)!
Delete Node (data = 1)!
Delete Node (data = 3)!
Delete Node (data = 1)!
Delete Node (data = 2)!
Delete Node (data = 4)!
Delete Node (data = 2)!
Delete Node (data = 5)!
Delete Node (data = -1)!
Delete Node (data = 1)!

转载于:https://my.oschina.net/tsh/blog/862912