2015年4月6日
PAT005 Path in a Heap
摘要： 题目：Insert a sequence of given numbers into an initially empty min-heap H. Then for any given index i, you are supposed to print the path from H[i] to ... 阅读全文
posted @ 2015-04-06 13:08 2020_xx 阅读(280) 评论(0) 推荐(0) 编辑
PAT004 Root of AVL Tree
摘要： 题目：An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at ... 阅读全文
posted @ 2015-04-06 10:55 2020_xx 阅读(302) 评论(0) 推荐(0) 编辑