#include<cstdio>
#include<iostream>
#include<string>
using namespace std;
struct node
{
char data;
node * ln;
node * rn;
node(char c)
:data(c)
,ln(NULL)
,rn(NULL)
c++二叉树通过先序中序确定后序
最新推荐文章于 2022-10-27 21:29:16 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)
#include<cstdio>
#include<iostream>
#include<string>
using namespace std;
struct node
{
char data;
node * ln;
node * rn;
node(char c)
:data(c)
,ln(NULL)
,rn(NULL)