数据结构 - 二叉树
文章平均质量分 84
i逆天耗子丶
这个作者很懒,什么都没留下…
展开
-
PAT - 甲级 - 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.Starting from one root supplier, every原创 2017-03-30 16:44:05 · 414 阅读 · 0 评论 -
PAT - 甲级 - 1066. Root of AVL Tree (25)(AVL平衡二叉查找树)
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原创 2017-11-13 15:46:24 · 317 阅读 · 0 评论 -
PAT - 甲级 - 1094. The Largest Generation (25)(树的遍历DFS)
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 with the largest population.Inpu原创 2017-11-12 11:12:47 · 334 阅读 · 0 评论 -
PAT - 甲级 - 1090. Highest Price in Supply Chain (25)(树的遍历DFS)
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原创 2017-11-12 10:49:12 · 260 阅读 · 0 评论 -
PAT - 甲级 - 1086. Tree Traversals Again (25)(已知中序+先序求后序)
An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the stac原创 2017-11-11 14:32:16 · 265 阅读 · 0 评论 -
PAT - 甲级 - 1079. Total Sales of Supply Chain (25)(DFS,遍历树)
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原创 2017-11-10 12:00:30 · 270 阅读 · 0 评论 -
PAT - 甲级 - 1064. Complete Binary Search Tree (30)(完全二叉搜索树层次遍历)
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 rig原创 2017-11-09 14:05:56 · 330 阅读 · 0 评论 -
PAT - 甲级 - 1053. Path of Equal Weight (30)(树的DFS搜索+排序)
Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti. The weight of a path from R to Lis defined to be the sum of the weights of all the nodes along the path from R t原创 2017-11-08 14:38:20 · 284 阅读 · 0 评论 -
PAT - 甲级 - 1043. Is It a Binary Search Tree (25)(递归建树,求后序,BST)
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 rig原创 2017-11-07 10:28:00 · 257 阅读 · 0 评论 -
PAT - 甲级 - 1099. Build A Binary Search Tree (30)(二叉搜索树+层次遍历+中序遍历)
题目描述: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.T原创 2017-03-30 23:13:11 · 1144 阅读 · 0 评论 -
PAT - 甲级 - 1102. Invert a Binary Tree (25)(中序遍历,层次遍历)
题目描述:The following is from Max Howell @twitter:Google: 90% of our engineers use the software you wrote (Homebrew), but you can't invert a binary tree on a whiteboard so fuck off.Now it's your原创 2017-03-30 22:14:27 · 499 阅读 · 0 评论 -
PAT - 甲级 - 1020. Tree Traversals (25)(层次遍历)
题目描述:Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence o原创 2017-03-30 09:59:10 · 723 阅读 · 0 评论 -
PAT - 甲级 - 1110. Complete Binary Tree (25) (判断完全二叉树+建树)
题目描述:Given a tree, you are supposed to tell if it is a complete binary tree.Input Specification: Each input file contains one test case. For each case, the first line gives a positive integer原创 2017-03-29 22:04:35 · 503 阅读 · 0 评论 -
PAT - 甲级 - 1004. Counting Leaves (30)(DFS/BFS,二叉树的遍历)
A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.InputEach input file contains one test case. Each case starts with a原创 2017-11-04 11:24:32 · 484 阅读 · 1 评论