![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
作业题
学校布置的作业
Flying`
这个作者很懒,什么都没留下…
展开
-
6.计算二叉树高度
#define _CRT_SECURE_NO_WARNINGS 1#include<stdio.h>#include<malloc.h>#include <stdio.h>#include <stdbool.h>#include <assert.h>#include <stdlib.h>#define MAXSIZE 1000typedef struct BrinaryTreeNode{ struct Brin.原创 2021-11-09 16:54:00 · 392 阅读 · 0 评论 -
5.二叉树左右child交换(C语言)
#define _CRT_SECURE_NO_WARNINGS 1#include<stdio.h>#include<malloc.h>#include <stdio.h>#include <stdbool.h>#include <assert.h>#include <stdlib.h>#define MAXSIZE 1000typedef struct BrinaryTreeNode{ struct Brin.原创 2021-11-09 16:33:44 · 303 阅读 · 0 评论 -
4.回文判断
#include<stdio.h>#include<string.h>#define Max 100void Yes_No(char *s,int len){ int mid=0; while(s!='\0') { if(s[mid]=='&') { break; } mid++; } int i=0; int j=0; f.原创 2021-11-04 10:36:55 · 89 阅读 · 2 评论 -
3.线性表逆置
#include<stdio.h>#include<malloc.h>typedef struct ListNode{ int data; struct ListNode *next;}Node;Node *BuySlistNode(int x){ Node *NewNode = (Node*)malloc(sizeof(Node)); NewNode->data = x; NewNode->next = NULL; return NewNo.原创 2021-11-04 10:34:02 · 695 阅读 · 2 评论 -
2.链表删除
#include<stdio.h>#include<malloc.h>typedef struct Node{ int data; struct Node *next;}ListNode;ListNode *BuyNode(int x)//申请结点{ ListNode *NewNode=(ListNode*)malloc(sizeof(ListNode)); NewNode->data=x; NewNode->ne.原创 2021-10-28 08:46:38 · 114 阅读 · 2 评论 -
1.有序链表合并
#include<stdio.h>#include<malloc.h>typedef struct Node{ int data; struct Node *next;}ListNode;ListNode *BuyNode(int x)//申请结点{ ListNode *NewNode=(ListNode*)malloc(sizeof(ListNode)); NewNode->data=x; NewNode->ne.原创 2021-10-28 08:43:31 · 135 阅读 · 0 评论