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
这里记录下堆的相关操作。
op 1：
'''
@ data: the heap array
@ p : index of parent item
@ n : number of data
@@ Swap p and it's son items, make p the largest of them
'''
def swapForMaxHeap(data, n, p):
l...
分类：
其他好文 时间：
2014-07-13 17:07:15
阅读次数：
223
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
1 #include 2 #include 3 #include 4 using namespace std; 5 6 void swap(int *a, int *b){ 7 int tmp; 8 tmp = *a; 9 *a = *b;10 *b = tmp;...
分类：
其他好文 时间：
2014-07-13 13:11:27
阅读次数：
190
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
/*
B - Cow Multiplication
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit
Status
Practice
POJ 3673
Description
Bessie is tired of multiplying pairs of numbers th...
分类：
其他好文 时间：
2014-07-12 19:19:02
阅读次数：
164
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
