zh的csnd

#include<cstdio>#include<iostream>using namespace std;#define MAXSIZE 1000void build_tree(int arr[], int tree[], int node, int start, int end){ if(start == end){ tree[node] = arr[start]; }else{ int mid = (start +

#include <iostream>#include <cstdio>#include <stdlib.h>using namespace std;//定义单链表的节点typedef struct LNode{ int data; struct LNode *next;}LNode, *LinkList;bool InsertPriorNode(LinkList &L,LNode *p, LNode *s);bool Inse