摘要：
1135 Is It A Red-Black Tree （30 分） There is a kind of balanced binary search tree named red-black tree in the data structure. It has the following 5 p 阅读全文
摘要：
1126 Eulerian Path （25 分） In graph theory, an Eulerian path is a path in a graph which visits every edge exactly once. Similarly, an Eulerian circuit 阅读全文
摘要：
1119 Pre- and Post-order Traversals （30 分） Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be dete 阅读全文
摘要：
1114 Family Property （25 分） This time, you are supposed to help us collect the data for family-owned property. Given each person's family members, and 阅读全文
摘要：
1112 Stucked Keyboard （20 分） On a broken keyboard, some of the keys are always stucked. So when you type some sentences, the characters corresponding 阅读全文
摘要：
1101 Quick Sort （25 分） There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one elemen 阅读全文
摘要：
1095 Cars on Campus （30 分） Zhejiang University has 8 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers 阅读全文
摘要：
1111 Online Map （30 分） Input our current position and a destination, an online map can recommend several paths. Now your job is to recommend two paths 阅读全文
摘要：
3月8日 概念专题 A - 边覆盖 Problem Description 对一个给定的无向图G(V,E)，边集E'是E的子集。如果V中的所有顶点都在E'中出现过，那么称边集E'是图G的一个边覆盖（Edge Cover）。 （以上定义引自https://en.wikipedia.org/wiki/E 阅读全文
摘要：
更新： （B题）判断两棵树是否相同时，也可以用中序序列+另一序列是否相同判断，本题中中序序列一定相同，只用比较另一个序列是否相同 概念专题 （D题） 1. 判断是否为bst时，可以直接中序遍历得到中序序列，如果中序序列是否有序（中序序列有序的树一定是bst，无序一定不是，具有一一对应的判定关系） / 阅读全文