二(多)叉树
文章平均质量分 83
ninesun127
有一个目标,总能让我们欢欣鼓舞~
展开
-
hdu1698 Just a Hook(线段树 区间更新+懒惰标记)
hdu1698 Just a Hook(区间更新+懒惰标记)Just a HookIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length.Now Pudge wants to do原创 2016-12-12 11:06:17 · 352 阅读 · 0 评论 -
百练 二叉树的操作(二叉树)
二叉树的操作查看提交统计提问总时间限制: 1000ms 内存限制: 65535kB描述给定一棵二叉树,在二叉树上执行两个操作:1. 节点交换把二叉树的两个节点交换。2. 前驱询问询问二叉树的一个节点对应的子树最左边的节点。输入第一行输出一个整数t(t 对于每组测试数据,第一行输入两个整数n m,n代表二叉树原创 2017-08-26 17:12:53 · 2056 阅读 · 0 评论 -
pat甲1110. Complete Binary Tree(完全二叉树)
1110. Complete Binary Tree (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven a tree, you are supposed to tel原创 2016-12-09 20:28:10 · 331 阅读 · 0 评论 -
pat甲:1004. Counting Leaves(dfs,多叉树)
1004. Counting Leaves (30)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA family hierarchy is usually presented by a原创 2016-12-06 22:07:55 · 251 阅读 · 0 评论 -
蓝桥杯 算法训练 FBI树(二叉树)
算法训练 FBI树 时间限制:1.0s 内存限制:256.0MB 问题描述 我们可以把由“0”和“1”组成的字符串分为三类:全“0”串称为B串,全“1”串称为I串,既含“0”又含“1”的串则称为F串。 FBI树是一种二叉树,它的结点类型也包括F结点,B结点和I结点三种。由一个长度为2N的“01”串S可以构造出一棵FBI树T,递归的构造原创 2017-03-28 22:00:51 · 1226 阅读 · 0 评论 -
pat 甲1127. ZigZagging on a Tree (已知后序及中序建树,并层次往返输出)
1127. ZigZagging on a Tree (30)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueSuppose that all the keys in a binary原创 2017-03-05 18:01:25 · 3029 阅读 · 0 评论 -
pat甲1123. Is It a Complete AVL Tree (AVL树+层次遍历+完全二叉树)
pat advanced level 1123. Is It a Complete AVL Tree (30)pat甲1123. Is It a Complete AVL Tree An AVL tree is a self-balancing 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 a原创 2016-12-13 17:22:03 · 1180 阅读 · 0 评论 -
pat甲1066. Root of AVL Tree(AVL树)
1066. Root of AVL Tree (25)时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueAn AVL tree is a self-balancing binary se原创 2016-12-10 21:15:08 · 204 阅读 · 0 评论 -
pat甲1115. Counting Nodes in a BST(BST二叉搜索树)
1115. Counting Nodes in a BST (30)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA Binary Search Tree (BST) is recu原创 2016-12-06 21:37:16 · 269 阅读 · 0 评论 -
pat 甲 1099. Build A Binary Search Tree (二叉搜索树)
1099. Build A Binary Search Tree (30)时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA Binary Search Tree (BST) is r原创 2017-03-03 16:45:52 · 261 阅读 · 0 评论 -
pat甲1020. Tree Traversals(已知后序和中序求层次遍历)
1020. Tree Traversals (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueSuppose that all the keys in a binary tree原创 2016-12-09 19:12:01 · 361 阅读 · 0 评论 -
pat甲1102. Invert a Binary Tree(二叉树的反转与遍历)
1102. Invert a Binary Tree (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThe following is from Max Howell @twi原创 2016-12-09 16:50:16 · 370 阅读 · 0 评论 -
pat甲1119. Pre- and Post-order Traversals (已知前序和后序遍历求中序遍历)
pat甲1119.pat advanced level 119. Pre- and Post-order Traversals (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, or preorder原创 2016-12-08 21:51:32 · 945 阅读 · 0 评论 -
AVL树(平衡二叉搜索树)
AVL树AVL树是带有平衡的二叉搜索树。它是每个结点的左子树和右子树的高度最多差1的二叉搜索树。(默认空树的高度为-1)为此,出去可能的插入外(我们假设懒惰删除)所有的树操作都可以在O(LOGN)时间复杂度执行。我们在插入的过程中,可能会破坏AVL树的平衡特性。易知 只有那些从插入点到根节点的路径上的结点的平衡可能被改变,因为只有这些结点的字数可能会发生变化原创 2016-12-10 20:03:07 · 450 阅读 · 0 评论 -
poj 1577 Falling Leaves(二叉搜索树)
Falling LeavesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5492 Accepted: 2950Description Figure 1Figure 1 shows a graphical representation of原创 2017-08-29 12:37:29 · 374 阅读 · 0 评论