摘要：
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le... 阅读全文
posted @ 2014-11-29 04:57
LiBlog
阅读(101)
评论(0)
推荐(0)
摘要：
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes... 阅读全文
posted @ 2014-11-29 02:51
LiBlog
阅读(181)
评论(0)
推荐(0)
摘要：
Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists: A: ... 阅读全文
posted @ 2014-11-29 02:27
LiBlog
阅读(209)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2]... 阅读全文
posted @ 2014-11-29 02:17
LiBlog
阅读(127)
评论(0)
推荐(0)
摘要：
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should return all... 阅读全文
posted @ 2014-11-29 02:12
LiBlog
阅读(134)
评论(0)
推荐(0)
摘要：
Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example,Given n = 3, there are a total of 5 unique BST'... 阅读全文
posted @ 2014-11-29 01:52
LiBlog
阅读(156)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and ... 阅读全文
posted @ 2014-11-29 01:23
LiBlog
阅读(146)
评论(0)
推荐(0)
摘要：
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.Solution: 1 /**... 阅读全文
posted @ 2014-11-29 01:01
LiBlog
阅读(164)
评论(0)
推荐(0)
浙公网安备 33010602011771号