Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Callingnext()will return the next...
分类：
其他好文 时间：
2015-04-13 20:42:55
阅读次数：
102
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 w...
分类：
其他好文 时间：
2015-04-13 18:25:39
阅读次数：
144
I saw a lot of BFS based solutions. And my alternative solution is this mirror-ed BST iterator one, with some book-keeping:class Solution {public: ...
分类：
其他好文 时间：
2015-04-13 12:22:37
阅读次数：
136
Given an array where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for binary tree * public class TreeN...
分类：
其他好文 时间：
2015-04-12 20:38:48
阅读次数：
159
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Callingnext()will return the next...
分类：
其他好文 时间：
2015-04-12 14:38:25
阅读次数：
134
Binary Search Tree Iterator
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.
Calling next() will return the next smallest...
分类：
其他好文 时间：
2015-04-11 00:03:47
阅读次数：
200
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.用空间换时间的方法，先用一个数组将节点按序存放，然后建树，代码如下：/** * D...
分类：
其他好文 时间：
2015-04-10 21:51:05
阅读次数：
117
这个内容是去年暑假讲的,但是一直没有实现,
其实说白了就是区间dp,求一个序列构成二叉树,中序遍历有序.
核心和其他区间dp一样,枚举中间值.然后枚举出来后再将整个区间的概率累加,因为相当于加深了一层.
JAVA代码,附测试数据
import java.util.Arrays;
import java.util.Scanner;
public class Main {
/*...
分类：
编程语言 时间：
2015-04-10 11:32:16
阅读次数：
135
【题目】
Given a 2d grid map of '1's (land) and '0's
(water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. Yo...
分类：
其他好文 时间：
2015-04-10 11:29:34
阅读次数：
136
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST....
分类：
编程语言 时间：
2015-04-10 09:32:42
阅读次数：
181
