#include<iostream>
#include<stdio.h>
#include<vector>
#include<map>
#include<algorithm>
#include<queue>
using namespace std;
struct TreeNode {
char val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(char x) :
val(x), left(NULL), right(NULL) {
}
};
TreeNode* make_tree(){
TreeNode* A = new TreeNode('A'); TreeNode* B = new TreeNode('B');
TreeNode* C = new TreeNode('C'); TreeNode* D = new TreeNode('D');
TreeNode* E = new TreeNode('E'); TreeNode* F = new TreeNode('F');
TreeNode* G = new TreeNode('G'); TreeNode* H = new TreeNode('H');
TreeNode* K = new TreeNode('K');
A->left = B;
A->right = E;
B->right = C;
C->left = D;
E->right = F;
F->left = G;
G->left = H;
G->right = K;
return A;
}
void delet_tree(TreeNode* head){
if (head ==
二叉树的生成,几种遍历,销毁的c++实现
最新推荐文章于 2023-09-26 08:22:12 发布
本文介绍了如何使用C++来创建、遍历(前序、中序、后序)和销毁二叉树。通过示例代码详细阐述了二叉树的基本操作,帮助读者理解数据结构中的二叉树概念。
摘要由CSDN通过智能技术生成