m0_46965984的博客

//算法5.2 中序遍历的非递归算法 #include<iostream> using namespace std; //二叉树的二叉链表存储表示 typedef struct BiNode { char data; //结点数据域 struct BiNode *lchild,*rchild; //左右孩子指针 }BiTNode,*BiTree; //链栈的定义 typedef struct StackNode { BiTNode data; struct St

1.二叉排序树 #include<iostream> using namespace std; typedef struct BiNode{ int data; struct BiNode *lchild,*rchild; }BiTNode,*BiTree; void CreateBiTree(BiTree &T){ int ch; cin >> ch; if(ch==-1) T=NULL; else{ T=new BiTNod