码迷,mamicode.com
首页 >  
搜索关键字:d. gukiz and binary    ( 11754个结果
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
poj 2309 BST(数学题)
BSTTime Limit:1000MSMemory Limit:65536KTotal Submissions:8440Accepted:5093DescriptionConsider an infinite full binary search tree (see the figure belo...
分类:其他好文   时间:2014-07-13 11:22:45    阅读次数:251
【leetcode】Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 ...
分类:其他好文   时间:2014-07-13 08:13:53    阅读次数:251
Add Binary
Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Return "100". public class Solution { public String addBinary(String a, String b) { ...
分类:其他好文   时间:2014-07-12 19:42:26    阅读次数:168
二叉排序树(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
求树的最小深度
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; ...
分类:其他好文   时间:2014-07-11 08:58:23    阅读次数:207
POJ-2201-Cartesian Tree(笛卡尔树)
Description Let us consider a special type of a binary search tree, called a cartesian tree. Recall that a binary search tree is a rooted ordered binary tree, such that for its every node x the fol...
分类:其他好文   时间:2014-07-11 00:12:52    阅读次数:379
Binary search for the first element greater than target
We all know how to search through an array for an element whose value equals the target value, but how to search for the element that has value greate...
分类:其他好文   时间:2014-07-10 16:08:21    阅读次数:168
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!