Data Structures and Algorithms
Parzivval
。
展开
-
6-3 Add Two Polynomials
6-3 Add Two Polynomials (20 分)Write a function to add two polynomials. Do not destroy the input. Use a linked list implementation with a dummy head node. Note: The zero polynomial is represented by ...原创 2018-11-10 19:51:59 · 639 阅读 · 0 评论 -
6-15 Iterative Mergesort
6-15Iterative Mergesort(25 分)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 time to merge a pa...原创 2018-12-10 21:29:46 · 813 阅读 · 5 评论 -
6-9 Sort Three Distinct Keys
Sort Three Distinct Keys (25 分)Suppose you have an array of N elements, containing three distinct keys, "true", "false", and "maybe". Given an O(N) algorithm to rearrange the list so that all "false...原创 2018-12-10 20:35:50 · 485 阅读 · 0 评论 -
No Greater Than X in BST
No Greater Than X in BST (20 分)You are supposed to output, in decreasing order, all the elements no greater than X in a binary search tree T.Format of function:void Print_NGT( Tree T, int X )...原创 2018-12-06 23:12:41 · 484 阅读 · 0 评论 -
AVL Insertion
AVL Insertion (30 分)You are supposed to implement the Insert function, which inserts an integer Key into an AVL tree T. The resulting tree must be returned.Format of function:AVLTree Insert ( A...原创 2018-12-06 20:51:55 · 1084 阅读 · 0 评论 -
7-14 Insertion or Heap Sort
7-14 Insertion or Heap Sort (25 分)According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort remo...原创 2018-12-12 14:15:43 · 561 阅读 · 0 评论 -
LCA in BST
LCA in BST (25 分)The lowest common ancestor (LCA) of two nodes u and v in a tree T is the deepest node that has both u and v as descendants. Given any two nodes in a binary search tree (BST), you a...原创 2018-12-04 23:48:10 · 525 阅读 · 0 评论 -
7-9 Huffman Codes
7-9Huffman Codes(30 分)In 1953, David A. Huffman published his paper "A Method for the Construction of Minimum-Redundancy Codes", and hence printed his name in the history of computer science. As a...原创 2018-11-23 12:53:06 · 216 阅读 · 0 评论 -
7-5 Tree Traversals Again
7-5 Tree Traversals Again (25 分)An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered f...原创 2018-11-22 18:29:14 · 853 阅读 · 0 评论 -
7-4 List Leaves
7-4 List Leaves (25 分)Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.Input Specification:Each input file contains one test case. For each case,...原创 2018-11-20 16:27:19 · 281 阅读 · 0 评论 -
7-2 Reversing Linked List
Reversing Linked List (25)热度指数:1386 时间限制:1秒 空间限制:32768K 算法知识视频讲解 Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. Forexample, given L...原创 2018-10-12 23:36:39 · 284 阅读 · 0 评论 -
6-2 Two Stacks In One Array
6-2 Two Stacks In One Array (20 分)Write routines to implement two stacks using only one array. Your stack routines should not declare an overflow unless every slot in the array is used.Format of f...原创 2018-11-08 22:20:12 · 510 阅读 · 0 评论 -
6-1 Deque
6-1 Deque (25 分)A "deque" is a data structure consisting of a list of items, on which the following operations are possible:Push(X,D): Insert item X on the front end of deque D. Pop(D): Remove th...原创 2018-11-08 22:19:27 · 284 阅读 · 0 评论 -
6-5 Evaluate Postfix Expression
Evaluate Postfix Expression(25 分)Write a program to evaluate a postfix expression. You only have to handle four kinds of operators: +, -, x, and /.Format of functions:ElementType EvalPostfix( ...原创 2018-10-22 15:27:21 · 585 阅读 · 0 评论 -
6-4 Reverse Linked List
6-4 Reverse Linked List (20 分)Write a nonrecursive procedure to reverse a singly linked list in O(N) time using constant extra space.Format of functions:List Reverse( List L );where List is ...原创 2018-11-10 22:09:13 · 1080 阅读 · 0 评论 -
7-13 Insert or Merge
7-13 Insert or Merge (25 分)According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one...原创 2018-12-12 10:41:16 · 213 阅读 · 0 评论