weixin_40654001的博客

BinaryTree.h#pragma once#include "stdafx.h"class BinaryTree{public: //tag标志符 1 = link 0 = thread struct node { int data; node * lchild; node * rchild; int ltag; int rtag; } *root;...

SearchBST输入:①开始搜索位置②搜索的值③搜索起始点的双亲节点④搜索结果的引用如果该点的值与搜索值相同，将搜索结果引用复制为该点并返回如果该点的值小于查询值，进入左子树查找，否则进入右子树查找参数为：①该点左子树②查找值③该点位置④搜索结果的引用InsertBST(即使未找到搜索结果,SearchBST也已经将预计插入点定位到叶子节点)输入:①插入起始点...

标头.h#pragma once#include "string"using namespace std;class SecondOptimalTree{public: struct elem { string name; int weight; }; elem * elem_data; int elem_length; int * sigma_weight;...

KWayMerge.h#pragma once#include "stdafx.h"#include "iostream"#include <stdlib.h>//归并段数#define K 5//每个并归段数据数量#define MAX_DATA_NUM 10//最大关键字#define MAX_KEY 9999

B+树插入执行顺序输入参数:①树根②插入值③生成的新叶子节点的引用(若没有则为NULL)根据键值查找到需要插入的叶子节点进行判断:若该叶子节点未满,则插入后退出若该叶子节点以满,则组织新叶子,然后将新叶子引用赋值为生成叶退出到上一层执行,进行判断①若生成新叶子且该点孩子数未满,则将新叶子加入自身并退出②若生成新叶子且该点孩子数已经满,则继续组织新叶子,并将新叶子赋值到新生成...

Sort.h#pragma onceusing namespace std;class Sort{public: void StraightInsertionSort(int data[], int length); void BinaryInsertionSort(int data[], int length); void TwoWayInsertionSort(int da...

Sort.h#pragma onceclass Sort{public: int Mod(int x, int y); void StraightInsertionSort(int data[], int length); void BinaryInsertionSort(int data[], int length); void TwoWayInsertionSort(int...

Graph.h#pragma once#define MAX_VERTEX_NUM 20#define INFINITY 9999/* 二维数组表示的无向图*/class Graph_Using_Array{public: int matrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; int arcnum; int vexnum; void...

Graph.h#pragma once#include "iostream"#define MAX_VERTEX_NUM 20#define INFINITY 9999using namespace std;/* 二维数组表示的无向图*/class Graph_Using_Array{public: /* 邻接矩阵 */ int matrix[MAX_VER...

Queue.h#pragma once#define MAX_LENGTH 100using namespace std;//环形数组队列class Circular_Queue{public: int head, tail; int arr[MAX_LENGTH]; void InitQueue(); bool En(int & data); bool ...

Stack.h#pragma once#define MAX_LENGTH 100class Stack{public: virtual void InitStack() = 0; //主要操作 virtual bool Push(int & data) = 0; virtual bool Pop(int & data) = 0; virtual bool...

源.cpp#include "stdafx.h"#include "iostream"#include "标头.h"using namespace std;struct AvlNode{ int data; AvlNode * lchild; AvlNode * rchild; int height; AvlNode(int elem, AvlNode * l, Avl..