m0_45384394的博客

//线索化 //线索二叉树 typedef struct Threadnode { int data; struct Threadnode* lchild; struct Threadnode* rchild; int ltag = 0; int rtag = 0; }*ThreadTree; //中序遍历线索化 void InThreadTree(ThreadTree T, ThreadTree pre) { ThreadTree p; if (p) { InThreadTree(p-

#include<stdio.h> #include<iostream> #include<stdlib.h> using namespace std; //数据结构 typedef struct BSTnode { int data; struct BSTnode* lchild; struct BSTnode* rchild; }*BSTree; //非递归查找 BSTree BST_search(BSTree T,int key) { BSTree p =

/* 二叉排序树(带有链队列的层次遍历) @hey超级巨星 */ #include<stdio.h> #include<stdlib.h> #include <iostream> using namespace std; #define ERROR 0 #define OK 1 typedef int Elemtype; typedef int Status; ...

/* @hey超级巨星 */ #include<stdio.h> #include<stdlib.h> #include<iostream> using namespace std; #define ERROR 0 #define OK 1 typedef int Elemtype; typedef int Status; //二叉树的链式存储 typedef ...