摘要： We have a network of computers and a list of bi-directional connections. Each of these connections allows a file transfer from one computer to another 阅读全文

摘要： A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only nodes 阅读全文

摘要： Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given Lbeing 1→2→3→4→5→6, 阅读全文

摘要： Given a sequence of K integers { N​1​​, N​2​​, ..., N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i+1​​, ..., N​j​​ } where 1. The Max 阅读全文

摘要： Write a program to find the weighted shortest distances from any vertex to a given source vertex in a digraph. If there is more than one minimum path 阅读全文

摘要： Write a program to not only find the weighted shortest distances, but also count the number of different minimum paths from any vertex to a given sour 阅读全文

摘要： How would you implement mergesort without using recursion? The idea of iterative mergesort is to start from N sorted sublists of length 1, and each ti 阅读全文

摘要： Write a program to find the unweighted shortest distances from any vertex to a given source vertex in a digraph. Format of functions: void ShortestDis 阅读全文

摘要： Write a program to find the strongly connected components in a digraph. Format of functions: void StronglyConnectedComponents( Graph G, void (*visit)( 阅读全文

摘要： Write a program to evaluate a postfix expression. You only have to handle four kinds of operators: +, -, x, and /. Format of functions: ElementType Ev 阅读全文