码迷,mamicode.com
首页 >  
搜索关键字:segmen tree    ( 18115个结果
CTCI 4.5
Implement a function to check if a binary tree is a binary search tree./* The inorder travel of a BST is strictly increasing. We track the pre node of...
分类:其他好文   时间:2014-07-13 22:27:09    阅读次数:344
Binary Tree Postorder Traversal
Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [3,2,1]. Note: Recursive solut...
分类:其他好文   时间:2014-07-13 17:18:19    阅读次数:193
Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example: Given the below binary tree and sum ...
分类:其他好文   时间:2014-07-13 13:58:01    阅读次数:184
CTCI 4.7
Design an algorithm and write code to find the first common ancestory of two nodes in a binary tree. Avoid storing additional nodes in data structure....
分类:其他好文   时间:2014-07-13 13:24:21    阅读次数:279
poj2255 Tree Recovery(求后续遍历,二叉树)
poj2255 Tree Recovery(求后续遍历,二叉树)...
分类:其他好文   时间:2014-07-13 00:08:35    阅读次数:200
ACdream原创群赛(16) F
MST Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others) SubmitStatus Problem Description Given a connected, undirected graph, a spanning tree of that graph is...
分类:其他好文   时间:2014-07-12 22:32:40    阅读次数:200
POJ 2367 Genealogical tree 拓扑题解
一条标准的拓扑题解。 我这里的做法就是: 保存单亲节点作为邻接表的邻接点,这样就很方便可以查找到那些点是没有单亲的节点,那么就可以输出该节点了。 具体实现的方法有很多种的,比如记录每个节点的入度,输出一个节点之后,把这个节点对于其他节点的入度去掉,然后继续查找入度为零的点输出。这个是一般的做法了,效果和我的程序一样的。 有兴趣的也可以参考下我这种做法。 #...
分类:其他好文   时间:2014-07-12 22:15:05    阅读次数:308
二叉排序树(BST)
二叉排序树: 二叉排序树(Binary Sort Tree)又称二叉查找树(Binary Search Tree),亦称二叉搜索树。 它或者是一棵空树;或者是具有下列性质的二叉树: (1)若左子树不空,则左子树上所有结点的值均小于它的根结点的值; (2)若右子树不空,则右子树上所有结点的值均大于它的根结点的值; (3)左、右子树也分别为二叉排序树; 注:中序遍历一棵二叉排序...
分类:其他好文   时间:2014-07-12 19:35:08    阅读次数:249
POJ-1785-Binary Search Heap Construction(笛卡尔树)
Description Read the statement of problem G for the definitions concerning trees. In the following we define the basic terminology of heaps. A heap is a tree whose internal nodes have each assigned...
分类:其他好文   时间:2014-07-12 18:52:12    阅读次数:285
LeetCode :: 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 nodes with keys less than the node's key.Th...
分类:其他好文   时间:2014-07-12 17:26:31    阅读次数:256
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!