weixin_44748812的博客

We have a network of computers and a list of bi-directional connections. Each of these connections allows a file transfer from one computer to another. Is it possible to send a file from any computer ...

将一系列给定数字插入一个初始为空的小顶堆H[]。随后对任意给定的下标i，打印从H[i]到根结点的路径。输入格式:每组测试第1行包含2个正整数N和M(≤1000)，分别是插入元素的个数、以及需要打印的路径条数。下一行给出区间[-10000, 10000]内的N个要被插入一个初始为空的小顶堆的整数。最后一行给出M个下标。输出格式:对输入中给出的每个下标i，在一行中输出从H[i]到根结点的路径上...

本题要求实现给定二叉搜索树的5种常用操作。函数接口定义：BinTree Insert( BinTree BST, ElementType X );BinTree Delete( BinTree BST, ElementType X );Position Find( BinTree BST, ElementType X );Position FindMin( BinTree BST );...

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node’s key.The right subt...

//冒泡排序、插入排序、希尔排序、选择排序、堆排序、归并排序、快速排序#include <iostream>#include <queue>#define INF 1000000;//无穷大using namespace std;/*-----------------------------------------------冒泡排序--------------...

样例（无向图）：1.Prim算法#include <iostream>#define MaxVertex 100#define INF 100000typedef int Vertex;typedef class MatrixGraph* MGraph;using namespace std;class MatrixGraph{public: void Bui...

样例：1.Dijkstra算法#include <iostream>#include <stack>#define inf 1000000#define MaxVertex 100using namespace std;typedef int Vertex;typedef class MatrixGraph* MGraph;class MatrixGra...

1.邻接矩阵#include <iostream>#include <queue>#define MaxVertexNum 100using namespace std;typedef int WeightType;typedef int Datatype;typedef int Vertex;typedef struct GNode* ptrToGNode...

#include <iostream>#define ERROR -1;using namespace std;typedef int Datatype;typedef struct HeapStruct* MaxHeap;struct HeapStruct{ Datatype *data;//存储堆元素的数组 int Size;//当前堆的容量 int Capac...

#include <iostream>using namespace std;typedef int Datatype;typedef struct TreeNode *BinTree;struct TreeNode{ Datatype data; BinTree Left; BinTree Right;};//创建BinTree CreateBinarySer...

递归实现：/*样例：3 4 6 0 0 7 8 0 0 0 0 前序：3 4 6 7 8 中序：6 4 8 7 3 后序：6 8 7 4 3*/#include <iostream>using namespace std;typedef class TreeNode BinTree;class TreeNode{public: TreeNode();...

顺序存储：#include <iostream>#define MAXSIZE 5//容量using namespace std;typedef int Datatype;typedef class Node Queue;class Node{public: Node(); ~Node() {}; void CreateQueue();//创建 int IsE...

顺序存储：#include <iostream>#define MAXSIZE 20//栈容量using namespace std;typedef int Datatype;typedef class Node Stack;class Node{public: Node(); ~Node() {}; void CreateStack();//创建 int I...

顺序存储：#include <iostream>#define MAXSIZE 20using namespace std;typedef int Datatype;typedef class ListNode List;class ListNode{public: ListNode() ; ~ListNode() {}; void CreateList();...