二叉树
文章平均质量分 85
小夥
这个作者很懒,什么都没留下…
展开
-
poj2255 Tree Recovery 字典树 解题报告(Ulm Local 1997)
Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes. This is an example of one of her creations:原创 2015-08-05 17:57:25 · 588 阅读 · 0 评论 -
团体程序设计天梯赛-练习集 L3-010. 是否完全二叉搜索树
L3-010. 是否完全二叉搜索树时间限制400 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者陈越将一系列给定数字顺序插入一个初始为空的二叉搜索树(定义为左子树键值大,右子树键值小),你需要判断最后的树是否一棵完全二原创 2016-07-20 12:20:25 · 594 阅读 · 0 评论 -
PAT (Advanced Level) 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 turn to prove that YOU CAN invert a binary tree!Input Specificati原创 2017-03-01 16:26:24 · 250 阅读 · 0 评论 -
二叉树的相互求解 已知前序中序求后序 已知后序前序求中序 已知前序后序求中序
二叉树的相互求解 已知前序中序求后序 已知后序前序求中序 已知前序后序求中序原创 2017-03-02 16:25:33 · 912 阅读 · 0 评论 -
PAT (Advanced Level) 1115. Counting Nodes in a BST (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 or equal to the node's key.The right subtree of a node contains only nodes with keys原创 2017-03-03 18:48:12 · 301 阅读 · 0 评论 -
团体程序设计天梯赛-练习集 L2-004. 这是二叉搜索树吗? 解题报告
L2-004. 这是二叉搜索树吗?时间限制400 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者陈越一棵二叉搜索树可被递归地定义为具有下列性质的二叉树:对于任一结点,其左子树中所有结点的键值小于该结点的键值原创 2017-03-15 08:09:39 · 603 阅读 · 0 评论 -
团体程序设计天梯赛-练习集 L2-006. 树的遍历 解题报告
L2-006. 树的遍历时间限制400 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者陈越给定一棵二叉树的后序遍历和中序遍历,请你输出其层序遍历的序列。这里假设键值都是互不相等的正整数。输入格式:输入第原创 2017-03-18 14:51:51 · 485 阅读 · 0 评论 -
团体程序设计天梯赛-练习集 L2-011. 玩转二叉树 解题报告
L2-011. 玩转二叉树时间限制400 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者陈越给定一棵二叉树的中序遍历和前序遍历,请你先将树做个镜面反转,再输出反转后的层序遍历的序列。所谓镜面反转,是指将所有非叶结点的左原创 2017-03-18 14:59:00 · 585 阅读 · 0 评论 -
PAT (Advanced Level) 1127. ZigZagging on a Tree (30) 解题报告
Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder traversal sequences. And it is a simple standard routine to print the numbers in level-order. However原创 2017-03-05 13:21:47 · 555 阅读 · 0 评论