码迷,mamicode.com
首页 >  
搜索关键字:二叉树.binary tree    ( 18099个结果
Scramble String
Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation...
分类:其他好文   时间:2014-06-04 20:11:38    阅读次数:303
Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only n...
分类:其他好文   时间:2014-06-03 14:00:56    阅读次数:281
Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is ...
分类:其他好文   时间:2014-06-03 13:53:21    阅读次数:309
1452: [JSOI2009]Count - BZOJ
DescriptionInputOutputSample InputSample Output12HINT一开始还想什么离线做,其实不用,空间足够,我们直接开100个二维树状数组,然后就行了但是如果c范围很大就离线做好一些 1 type 2 tree=array[0..300,0..300]...
分类:Web程序   时间:2014-06-03 12:26:54    阅读次数:277
Sum Root to Leaf Numbers
Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which rep...
分类:其他好文   时间:2014-05-30 16:32:52    阅读次数:226
Populating Next Right Pointers in Each Node II
Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil...
分类:其他好文   时间:2014-05-30 16:17:49    阅读次数:210
Flatten Binary Tree to Linked List
Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened t...
分类:其他好文   时间:2014-05-30 16:15:02    阅读次数:224
Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree./** * Definiti...
分类:其他好文   时间:2014-05-30 16:12:22    阅读次数:288
JQuery EasyUi Tree获取所有checkbox选中节点的id和内容
jQuery EasyUI Tree Create from HTML markup Folder Sub Folder 1 File 11 File 12 File 13 File 2 File 3 File 4 File 5 ...
分类:Web程序   时间:2014-05-29 17:48:25    阅读次数:473
笔试算法题(51):简介 - 红黑树(RedBlack Tree)
红黑树(Red-Black Tree)红黑树是一种BST,但是每个节点上增加一个存储位表示该节点的颜色(R或者B);通过对任何一条从root到leaf的路径上节点着色方式的显示,红黑树确保所有路径的差值不会超过一倍,最终使得BST接近平衡;红黑树内每个节点包含五个属性:color, key, lef...
分类:数据库   时间:2014-05-29 16:51:27    阅读次数:400
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!