lingling_nice的博客

1.前序创建#include<stdio.h>#include<string.h>#include<stdlib.h>#include<malloc.h>#include<iostream>#include<stack>#include<queue>using namespace std;typed

前序遍历//二叉树的前序遍历（递归）void pre_order(BtNode *ptr){ if(ptr==NULL) { return; }      cout << T->data << " "; pre_order(ptr->leftchild);pre_order(ptr->rightchild);}中序遍历：//二叉树的中...

#include<malloc.h>#include<iostream>#include<stack>#include<queue>using namespace std;typedef  char ElemType;typedef struct  BtNode{ BtNode *leftchild; BtNode *rightch...

1.根据已存在的链式二叉树转为顺序存储（数组）形式的二叉树结构void CreateTree_br(BtNode* node, ElemType* br, int len, int pos)//根据链式二叉树建立数组形式的二叉树{ if (node == NULL || br == NULL || len<1) //pos:在数组中的下标位置 { return; }...

准备：#include<iostream>using namespace std;typedef char ElemType; #define END '#'typedef struct BtNode{ BtNode *leftchild; BtNode *rightchild; ElemType data;}BtNode,*BinaryTree;//...