摘要：
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 any 阅读全文
摘要：
On a broken keyboard, some of the keys are always stucked. So when you type some sentences, the characters corresponding to those keys will appear rep 阅读全文
摘要：
继续加油 2018/6/27 阅读全文
摘要：
1110 Complete Binary Tree (25)（25 分） Given a tree, you are supposed to tell if it is a complete binary tree. Input Specification: Each input file cont 阅读全文
摘要：
The basic task is simple: given N real numbers, you are supposed to calculate their average. But what makes it complicated is that some of the input n 阅读全文
摘要：
People on Mars count their numbers with base 13: Zero on Earth is called "tret" on Mars. The numbers 1 to 12 on Earch is called "jan, feb, mar, apr, m 阅读全文