C++

A simulated function aims to find the nearest common ancestor of a pair of nodes. the implementation idea is to map the tree to an array first, and set the value range with the node to root, and the value ranges of other nodes to the parent node

Red/black tree, I remember I found this thing when I first bought the book. I thought it was mysterious and finally got in touch with it. I have already written it. I'm very happy. The inserted routine is included in the book.CodeImplemented. I am

I like the idea of merging two text files. /* 7-37-11-27-22.11.c -- Chapter 7, question 1 */ # include int main (void); int main (void) { file * FPA, * FPB, * FPC; char Cha, ChB; FPA = fopen ("a.txt", "R "); FPB = fopen ("B .txt", "R"

It is used to simulate the number of conflicts between two hashes by linear detection, square detection, and hash. The size of a random sequence can be specified to generate a random sequence repeatedly. you can specify the table size and change the

I thought it was very simple, but I accidentally did it for five hours. Fortunately, I got it. I will not talk about it much, but I will post the code, which is very clear. Node * findkthmin_s (const splaytree * const PST, int K) { node * scan;

/* K-dTree.c -- k-D tree implementation file */ # include "k-dTree.h" /* local function declaration */ /* queue */ static queuenode * makenode_q (node * const Pn, const int index); /* k-D tree part */ static node * makenode_k (const item * const

No time analysis is provided in the book. I have also thought about it myself and want to give a very good idea, but it is very difficult to give the exact time. This is completely based on the Operation Sequence to generate various heights,

It took 18 hours to finish the study. Am I too stupid? But fortunately, it was written. Clean up and prepare to visit the city. I hope to bring back the real data for my reference. /* 9-32 (a)-12-29-21.48.c -- Chapter 9, question 1 */ # include #

/* Hash. H -- hash header file */ Enum kindofentry {legitimate, empty, deleted}; # define prime (7) # define failed (-2) # define NUL ('/0') # define false (0) # define true (1) /* data type definition */ typedef char name; typedef struct

My God! If no code is available, I am crazy .!!! Fortunately, after so long, the Code finally came out. Every time I write, I tell myself. I have to write some strong words after writing this ,.... as a result, no. basically... after writing it, I

/* Binary_heap.h -- binary heap file */ # include "new_adjacenty_list.h" /* data type definition */ typedef vertex * heap_item; typedef struct binary_heap { heap_item * heap; int capacity; int current; }* binary_heap; /* interface function

/* Extendible_hashing.c -- the file that can be expanded into columns */ # include # include # include "extendible_hashing.h" /* local function declaration */ static char pow_base_two (const int power); /* interface function definition */

There is a shadow of the randomization algorithm, so that each node maintains the heap order with the priority value, and then controls the tree height. This is a good idea and easy to implement. /* Treaptree. H -- treap tree header file */ #

/* Priorityqueue. C -- Minimum heap implementation file */ # include "priorityqueue. H " /* local function declaration */ static bool percolateup_p (prioritynode * const heap, const int position, const int size); static bool percolatedown_p

/* 2dtree. C -- 2-D tree implementation file */ # include "2dtree. H " /* local function declaration */ /* queue part */ static queuenode * makenode_q (node * const Pn, const int index); /* 2-D tree part */ static node * makenode_t (const item *

Wish yourself a happy Valentine's Day. Today is July 22, lunar January 15. I studied the rebuilding of toll roads at home for a day. It is shameful that it is not correct yet. However, we found that there was a problem with the original skip table.

This heap sorting uses a new filter function. You cannot analyze the running time for the moment. Let's go back and calculate it, even if it is roughly dependent on the clock timer. /* 7-40-11-27-23.10.c -- Chapter 7, question 1 */ # include #

// Neartree. H -- kinship tree header file # include namespace tree { typedef int item; typedef struct node { item; item minofall, maxofall; int mingap; struct node * left, * right; } node; const int infinity = ~ (1 class neartree {

// Neartree. CPP-implementation file of the kinship tree # include "stdafx. H " # include" neartree. H " namespace tree { // Private: int neartree: m_min (const int, const int B, const int C, const int d) const { int min = A; If (min> B) min =

The Interval Tree is also an extended data structure based on a binary tree. Each node stores the interval information. This routine is mainly written for the next thing. Of course, it is also worth a long time. // Intervaltree. H -- Interval Tree