二叉树(结点释放)

#include struct Node {int data;struct Node *left;struct Node *right;Node(int x) {data &＃61; x;left &＃61; NULL;right &＃61; NULL;}
};void PostorderVisitTree(struct Node *root)
{if (root &＃61;&＃61; NULL) return;PostorderVisitTree(root->left);PostorderVisitTree(root->right);printf("%d ", root->data);
}void _delBinTree(struct Node *root)
{if (root &＃61;&＃61; NULL) return;_delBinTree(root->left);_delBinTree(root->right);printf("Delete Node (data &＃61; %d)!\n", root->data);delete (root);root &＃61; NULL;
}void deleteTree(struct Node **node)
{_delBinTree(*node);*node &＃61; NULL;
}int main(int argc, char** argv)
{Node *root &＃61; new Node(1);root->left &＃61; new Node(3);root->left->left &＃61; new Node(2);root->left->right &＃61; new Node(1);root->left->right->left &＃61; new Node(1);root->right &＃61; new Node(-1);root->right->left &＃61; new Node(4);root->right->left->left &＃61; new Node(1);root->right->left->right &＃61; new Node(2);root->right->right &＃61; new Node(5);root->right->right->right &＃61; new Node(2);PostorderVisitTree(root);printf("\n");deleteTree(&root);return 0;
}


输出结果&＃xff1a;

2 1 1 3 1 2 4 2 5 -1 1
Delete Node (data &＃61; 2)!
Delete Node (data &＃61; 1)!
Delete Node (data &＃61; 1)!
Delete Node (data &＃61; 3)!
Delete Node (data &＃61; 1)!
Delete Node (data &＃61; 2)!
Delete Node (data &＃61; 4)!
Delete Node (data &＃61; 2)!
Delete Node (data &＃61; 5)!
Delete Node (data &＃61; -1)!
Delete Node (data &＃61; 1)!