树
文章平均质量分 59
NJNUqhx
大一新生,努力学习ing
展开
-
2021年2月7日18:29:12 二叉树基本操作,堕落了几天才敲代码
#include<stdio.h> #include<stdlib.h> struct BinaryTree { int val; struct BinaryTree* left; struct BinaryTree* right; }; struct TreeNode { struct BinaryTree* node; struct TreeNode* next; }; struct Queue { struct TreeNode* front; struct .原创 2021-02-07 18:30:19 · 76 阅读 · 0 评论 -
树2.0
#include<stdio.h> #include<stdlib.h> #include<malloc.h> #include<time.h> #define max(a,b) ((a>b)?a:b) #define min(a,b) ((a<b)?a:b) #define minum -1000 #define maxum 1000 typedef struct Tree tree; typedef struct Queue queue; ty原创 2021-01-09 08:36:10 · 94 阅读 · 0 评论 -
树1.0(遍历,插入)
#include<stdio.h> #include<stdlib.h> #include<malloc.h> typedef struct Tree tree; typedef struct Queue queue; typedef struct Stack stack; struct Tree { int value; struct Tree* left; struct Tree* right; }; struct treenode ...原创 2021-01-04 17:55:12 · 80 阅读 · 0 评论