weixin_54664477的博客

#include<stdio.h>#include<stdlib.h>#include<string.h>#include<iostream>using namespace std;//二叉树的结构定义typedef struct Node { char data; struct Node* lchild, * rchild;}Node;typedef struct tree { Node* root; int length;}Tr.

//令人头大的 ·二叉搜索树·#include<stdio.h>#include<stdlib.h>#include<time.h>typedef struct Node { int val,size;//size代表当前节点下面有几个节点 struct Node* left, * right;}Node; //开课吧平衡二叉树上有具体讲解NILNode __NIL;#define NIL (&__NIL)#define INITIA.

#include<stdio.h>#include<stdlib.h>#include<time.h>typedef struct Node { int data; struct Node* lchild, * rchild;}Node;typedef struct Tree { Node* root; int length;}Tree;Node* get_newNode(int val) { Node* p = (Node*)malloc(si.

#include<stdlib.h>#include<stdio.h>#include<time.h>#define COLOR(a,b) "\033[" #b "m" a "\033[0m"#define GREEN(a) COLOR(a,32)#define RED(a) COLOR(a,31)typedef struct Stack { int *data; int top, size;};Stack* init(int n) { Stack.

#include<stdio.h>#include<stdlib.h>#include<time.h>#define COLOR(a,b) "\033[" #b "m" a "\033[0m"#define GREEN(a) COLOR(a,32)#define RED(a) COLOR(a,31)typedef struct Queue { int* data; int head, tail, length; int count;};Queue*.

#include<stdio.h>#include<stdlib.h>#include<time.h>#define COLOR(a, b) "\033[" #b "m" a "\033[0m"#define GREEN(a) COLOR(a,32) #define RED(a) COLOR(a,31)//定义typedef struct Vector { int *data; int size, length;}Vec;//初始化Vec* in.

#include<stdio.h>#include<time.h>#include<stdlib.h>#define COLOR(a,b) "\033[" #b "m" a "\033[0m"#define GREEN(a) COLOR(a,32)typedef struct Node { int data; struct Node* next;}Node;typedef struct List { Node head; //如果不用指针变量来存储，.