本篇用一棵根节点为8的二叉搜索树来遍历
8、5、10、3、7、9、11
#include<stdio.h>
#include<stdlib.h>
#pragma warning(disable:4996)
typedef struct Tree {
int Data;
struct Tree *Lc;
struct Tree *Rc;
}Btree; //一个树节点
typedef struct Node {
Btree *P1;
struct Node *rear;
}Nodes; //栈
void Push(Node**top, Btree*P2) ;//进栈
void Pop(Node**top); //出栈
Btree *insert(Btree*Ntree, int a);//插入节点
void Beorder(Btree* Ntree); //后序遍历
int main() {
int a;
Btree *Ntree;
Ntree = (Btree*)