qq_43252509的博客

啊啊啊啊

#include <iostream>#include <stdlib.h>#include <stdio.h>using namespace std;typedef struct node{ int info; node* lchild; node* rchild;}node,*Pnode;Pnode creatnode...

#include<iostream>#include <stdlib.h>#include <stdio.h>#include <string.h>using namespace std;typedef struct node{ char info; node* lchild; node* rchild; }node, *P...

#include<iostream>#include <stdlib.h>#include <stdio.h>using namespace std;typedef struct node{ char info; node* lchild; node* rchild; }node, *Pnode;//树的结构体 Pnode creat...

#include<iostream>#include <stdlib.h>#include <stdio.h>using namespace std;typedef struct node{ char info; node* lchild; node* rchild; }node, *Pnode;//树的结构体 int cnt=0;/...

我并不会写广义表，所以用了栈......#include<iostream>#include<stdio.h>#include<stdlib.h>#include<string>using namespace std;int main(){ string s; cin>>s; int max=-1;...

Description:如果用大写字母标识二叉树结点，则一棵二叉树可以用符合下面语法图的字符序列表示。是编写递归程序，由这种形式的字符序列，建立相应的二叉树链表存储结构；#include<iostream>#include <stdlib.h>#include <stdio.h>using namespace std;typedef str...

#include <iostream>#include <stdio.h>#include<stdlib.h>using namespace std;typedef struct Triple{ int i,j; //行号，列号 int num;//数值 }Triple;typedef struct TS{ ...

描述试写一个判定给定二叉树是否为二叉排序树的程序，设此二叉树以二叉链表做存储结构，且结点的关键字均不同输入输入一个二叉树的先序序列，若某个节点没有左孩子（右孩子），则左孩子（右孩子）用0表示输出输出二叉树的中序遍历序列，并判断该二叉树是否为二叉排序树，若是，则输出“ItisanBinaryOrderTree!”，否则输出“ItisnotanBinaryOr...

1.快速排序void quicksort(int a[],int left,int right){2.归并排序void mergeArray(int a[],int left,int middle,int right,int b[]){//合并数组的算法void mergeSort(int a[],int left,int right,int b[])3.冒泡排序void...

#include <iostream>#include <stdlib.h>#include <stdio.h>using namespace std;typedef struct SeqList{ int arr[1000]; int length;}SeqList,*PSeqList;void creat(PSeqList list...

#include <iostream>#include <stdlib.h>#include <stdio.h>using namespace std;typedef struct SeqList{ int arr[1000]; int length;}SeqList,*PSeqList;typedef struct node...

#include<iostream>#include<stdlib.h>#include<stdio.h>using namespace std;typedef struct SeqList{ int info[1000]; int length;}SeqList,*PSeqList;void creat(PSeqList list){...

#include <iostream>#include <stdio.h>#include <stdlib.h>using namespace std;typedef struct node{ int info; node* lchild; node* rchild;}node,*Pnode;Pnode creat(...