12 2014 档案

04-1. Root of AVL Tree (25)
摘要：04-1. Root of AVL Tree (25)An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node diffe... 阅读全文

posted @ 2014-12-24 21:31 findmehere 阅读(684) 评论(1) 推荐(1)

03-3. Tree Traversals Again (25)
摘要：03-3. Tree Traversals Again (25)An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that whe... 阅读全文

posted @ 2014-12-22 17:23 findmehere 阅读(879) 评论(0) 推荐(0)

01-1. 最大子列和问题(20)
摘要：01-1. 最大子列和问题(20)给定K个整数组成的序列{ N1, N2, ..., NK }，“连续子列”被定义为{ Ni, Ni+1, ..., Nj }，其中 1 #include int MaxSubseqSum(const int data[],int datalen); ... 阅读全文

posted @ 2014-12-10 23:21 findmehere 阅读(795) 评论(0) 推荐(0)

导航