- 博客(11)
- 收藏
- 关注
RSS订阅原创 一道考研题
第58题。数据输入换成数字，方便点，先建立二叉树再输出。 #include<iostream> #include<queue> using namespace std; struct node { int data; node* lchild; node* rchild; }; const int maxn = 35; int pos[maxn]; int ...
2018-10-31 23:24:27
168
原创 PAT.A1107 Social Clusters
When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. A social cluster is a set of people who have some of thei...
2018-10-28 02:54:04
93
原创 PAT.A1066 Root of AVL Tree
An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is...
2018-10-26 18:33:56
92
原创 PAT.A1099 Build A Binary Search Tree
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only nodes with keys less than the node's key. The right su...
2018-10-19 15:52:29
284
原创 PAT.A1064 Complete Binary Search Tree
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only nodes with keys less than the node's key. The right su...
2018-10-19 15:25:00
123
原创 PAT.A1043 Is It a Binary Search Tree
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only nodes with keys less than the node's key. The right su...
2018-10-18 03:52:28
78
原创 PAT.A1004 Counting Leaves
A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child. Input Specification: Each input file contains one test case. Each case starts...
2018-10-12 04:06:33
101
原创 PAT.A1106 Lowest Price in Supply Chain
A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone involved in moving a product from supplier to customer. Starting from one root supplier, everyone on th...
2018-10-10 01:54:32
90
原创 PAT.A1094 The Largest Generation
void bfs() { int level = 2, last = 1, first = 0, rear = 0, num = 0; queue<int> q; q.push(1); //l[1] = 1; rear++; lnum[1] = 1; while (!q.empty()) { int f = q.front(); q.pop(); fi...
2018-10-08 03:35:59
96
原创 PAT A1090 Highest Price in Supply Chain
#include<iostream> #include<cstdio> #include<algorithm> #include<cmath> #include<vector> #include<queue> #include<cstring> #include&am
2018-10-06 17:19:03
74
原创 PAT.1079 Total Sales of Supply Chain
#include<iostream> #include<cstdio> #include<algorithm> #include<cmath> #include<vector> #include<queue> #include<cstring> #include&am
2018-10-05 16:01:14
98
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人