树算法
文章平均质量分 95
小魚兒.
天下皆白,唯我独黑!
展开
-
9.0树与二叉树基础算法
#include <cstdio>#incldue <queue>#include <stack>using namespace std;//二叉树 struct node{ typename data; node* lchild; node* rchild;};node *root=NULL;//1建立新结点,v为结点权值node...原创 2019-10-24 16:13:17 · 105 阅读 · 0 评论 -
9.0二叉树静态写法
//二叉树的静态实现//静态是指;结点的左右指针域用int型代替,用来表示左右子树的根节点在数组中的下标。//为此要建立一个大小为结点上限个数的node型数组,所有动态生成的结点都直接使用数组中的结点//所有指针的操作都改为对数组下标的访问//结点定义struct node{ typename data; int lchild; int rchild;}Node[maxn];...原创 2019-10-24 16:12:11 · 167 阅读 · 0 评论 -
9.3 静态树写法
#include <cstdio>#include <vector>#include <queue>using namespace std;//树的算法//1、静态写法const int maxn=110;struct node { int data; //typename data; vector<int> child;//...原创 2019-10-24 16:10:41 · 149 阅读 · 0 评论 -
Code Up 9.6问题 D: More is better(并查集的应用)
问题 D: More is better题目描述Mr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the better it will be. Of course there are certain require...原创 2019-10-20 16:52:16 · 157 阅读 · 0 评论 -
Code Up 9.6问题 C: How Many Tables(并查集的应用)
问题 C: How Many Tables题目描述Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not al...原创 2019-10-20 15:33:55 · 151 阅读 · 0 评论 -
Code Up 9.6问题 B: 畅通工程(并查集应用)
问题 B: 畅通工程题目描述某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通(但不一定有直接的道路相连,只要互相间接通过道路可达即可)。问最少还需要建设多少条道路?输入测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数,分别是城镇数目N ( < 1000 )和道路数目M...原创 2019-10-20 15:14:44 · 208 阅读 · 0 评论 -
Code Up 9.6问题 A: 通信系统(并查集的应用)
问题 A: 通信系统题目描述某市计划建设一个通信系统。按照规划,这个系统包含若干端点,这些端点由通信线缆链接。消息可以在任何一个端点产生,并且只能通过线缆传送。每个端点接收消息后会将消息传送到与其相连的端点,除了那个消息发送过来的端点。如果某个端点是产生消息的端点,那么消息将被传送到与其相连的每一个端点。为了提高传送效率和节约资源,要求当消息在某个端点生成后,其余各个端点均能接收到...原创 2019-10-19 15:55:05 · 215 阅读 · 0 评论 -
PAT A1066 Root of AVL Tree (25 分)(AVL树的建立)
1066 Root of AVL Tree (25 分)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...原创 2019-10-18 15:21:11 · 93 阅读 · 0 评论 -
PAT A1004 Counting Leaves (30 分)(静态树求每一层上叶节点的个数)BFS+DFS
1004 Counting Leaves (30 分)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 on...原创 2019-10-15 14:53:10 · 101 阅读 · 0 评论 -
PAT A1106 Lowest Price in Supply Chain (25 分)(静态树求最小深度及其最小价格)
1106 Lowest Price in Supply Chain (25 分)A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in moving a product from supplier to customer.Start...原创 2019-10-14 15:08:08 · 70 阅读 · 0 评论 -
PAT A1094 The Largest Generation (25 分)(静态树求每层结点个数——DFS写法)
1094 The Largest Generation (25 分)A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level belong to the same generation. Your task is to find the generation ...原创 2019-10-13 16:13:48 · 86 阅读 · 0 评论 -
PAT A 1079 Total Sales of Supply Chain (25 分)(静态树求权值及深度)#include <cstdio> #include <vector> #include
1079 Total Sales of Supply Chain (25 分)A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in moving a product from supplier to customer.Starti...原创 2019-10-13 15:08:50 · 147 阅读 · 0 评论 -
PAT A1090 Highest Price in Supply Chain (25 分)(DFS求树的最大深度)
1090 Highest Price in Supply Chain (25 分)A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in moving a product from supplier to customer.Star...原创 2019-10-12 15:57:24 · 135 阅读 · 0 评论 -
Code Up 9.3问题 A: 树查找(利用二叉树及完全二叉树的高度性质输出结点)
问题 A: 树查找题目描述有一棵树,输出某一深度的所有节点,有则输出这些节点,无则输出EMPTY。该树是完全二叉树。输入输入有多组数据。每组输入一个n(1<=n<=1000),然后将树中的这n个节点依次输入,再输入一个d代表深度。输出输出该树中第d层得所有节点,节点间用空格隔开,最后一个节点后没有空格。样例输入51 2...原创 2019-10-12 14:57:10 · 151 阅读 · 0 评论 -
1053 Path of Equal Weight (30 分)(树的静态写法的应用——求路径上的权值)
1053 Path of Equal Weight (30 分)Given a non-empty tree with root RRR, and with weight WiW_iWi assigned to each tree node TiT_iTi. The weight of a path from RRR to LLL is defined to be the sum ...原创 2019-10-11 18:24:36 · 187 阅读 · 0 评论