C++

/* Threaded_tree.h -- header file of the clue tree */ # define link 0 # define thread 1 /* data type definition */ typedef int item; typedef struct node { item; struct node * left; struct node * right; int left_tag; int right_tag; }node;

/* Open_addressing_hash (2) -- open the fixed address hash implementation file */ # include # include # include "open_addressing_hash (2 ). H " /* local function declaration */ static int get_prime_value (const int size ); static int

Void preorderthreading (TREE * const ptree); static void preorder_threading (TREE * const ptree, node ** const previous); void preorderthreadedtraversal (const TREE tree, void (* pfun) (const item); void preorderthreading (TREE * const ptree) {

Static node * search_the_deepmost_node (const tree) { node * left_node, * right_node; If (tree! = NULL) { left_node = search_the_deepmost_node (tree-> left); right_node = search_the_deepmost_node (tree-> right ); If (null = left_node & null =

It was written at 03:27 a.m., but it was not written. I woke up and wrote it. the main problem is that when the array size is not the power of 2, the right_end is out of the range. my logic was originally complicated, and then I re-organized the

Int insert (TREE * const ptree, const item * const pitem) { node * new_node; node * parent, * scan = * ptree; If (null = (new_node = make_node (pitem) return 0; If (treeisempty (ptree) { * ptree = new_node; (* ptree)-> left = NULL; (* ptree)->

/* 17-8-09-11-21.20.h -- Chapter 8 Question */ # ifndef last_h _ # define add_an_item 1 # define size 20 /* define the data type *//* name_and_pet data type exposed to the user */ typedef struct name_and_pet { char petname [size]; /* pet name */

I thought this was something that could be written soon, even a few days ago. the implementation part uses a table and a size linked list. but in fact I did not write for 8 hours... it would be nice to finish writing, or I will be very

The fourth day of the learning tree, the first class stretched the tree. I wrote it for 8 hours. It was so sleepy. It felt so good. After writing it, I read it again and wrote it down. I hope someone else will be willing to communicate with me. /*

/* Open_addressing_hash.h -- open the header file of the fixed address hash list */ Enum kindofentry {legitimate, empty, deleted }; /* data type definition */ typedef int item; typedef struct cell { item; Enum kindofentry Info; } cell; typedef

/* Separate_chaining_hash -- detach the link hash to implement the file */ # include # include # include "separate_chaining_hash.h" /* local data type definition */ typedef struct pair { listnode * parent; listnode * Current; } pair; /*

/* Open_addressing_hash (2 ). H -- open the address hash header file */ Enum kindofentry {legitimate, empty, deleted }; /* data type definition */ typedef int item; typedef struct cell { item; Enum kindofentry entry; } cell; typedef struct

/* Open_addressing_double_hash.h -- enable the address-specific hash header file */ Enum kindofentry {legitimate, empty, deleted }; # define prime 7 /* data type definition */ typedef int item; typedef struct cell { item; Enum kindofentry Info;

I used deep-priority search, which is different from the method I used six months ago to check the vertex input level. I am still confused about this. I used some STL for this thing. Although I haven't started to systematically learn STL, I will use

/* D-heap.c -- d-heap implementation file */ # include # include # include "d-heap.h" /* local function declaration */ static int percolate_up (const heap * const pheap, const item, const int position); static int percolate_down (const heap *

It's depressing that I haven't updated my blog for several days. this left-side heap doesn't want to write it down. It's hard to write it, so let's get to the end first. after all, learning the data structure is not an overnight task. I will look

This oblique heap does not detect xx. I didn't write it out because I didn't understand what the book meant. however, it seems to be a theoretically avoided 100% detection. or, at least, some facts verify the correctness of the Code. Hope you can

/* Box. C -- box problem implementation file */ # ifndef generic # include "box. H " # endif /* local function declaration */ static box * make_box (const weight capacity ); static box * find_max (Box * box); static box * find_min (Box * box );

/* Binomial-queue.h -- two queue header files *//* It is a good idea to load header files in the header file */ # include # include # define infinity 32767 /* data type definition */ typedef int item; // Why do I like int ^ typedef struct node

A question. I started thinking about it yesterday, and today I think about it again. I admit that my head is confused, but it is a little slow and I cannot accept it. "Do not rush to continue, do not even thousands of miles; do not accumulate small