You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link...
分类：
其他好文 时间：
2014-07-13 18:20:52
阅读次数：
202
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
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-13 16:53:01
阅读次数：
189
Given two binary trees, write a function to check if they are equal or not.
Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
/**
* Defin...
分类：
其他好文 时间：
2014-07-13 15:50:25
阅读次数：
158
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
You have two very large binary trees: T1, with millions of nodes, and T2, with hundreds of nodes. Create an algorithm to decide if T2 is a subtree of ...
分类：
其他好文 时间：
2014-07-13 13:04:00
阅读次数：
186
Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.
Your algorithm should use only constant space. Y...
分类：
其他好文 时间：
2014-07-12 20:39:17
阅读次数：
225
Problem Description:
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
If the number of nodes is not a multiple of k then left-out nodes in the...
分类：
其他好文 时间：
2014-07-12 19:00:26
阅读次数：
235
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
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
