# 38209 explain it cards set 6

...
• 2
• 107
• 0

## Problem Set 6 Part 1: Pointers to pointers. Multidimensional arrays. Stacks and queues.

... � � � � "an" � � � � "and" "ca" � � � � � � � � "ant" "cat" Figure 6. 2 -1: Trie structure (translations not shown) For each node, its key (e.g and ) is not explicitly stored in the node; instead, ... array of children In this problem, you will utilize a trie structure and to implement a simple one-way Englishto-French dictionary The trie structure, shown in Figure 6. 2-1, consists of nodes, ... consists of nodes, each of which contains a string for storing translations for the word speciﬁed at that node and an array of pointers to child nodes Each node, by virtue of its position in the...
• 3
• 203
• 0

## Problem Set 6 – Solutions Part 1: Pointers to pointers. Multidimensional arrays. Stacks and queues.

... d e r r ) ; goto c l e a n u p ; } (b) Now, an inﬁx calculator really is not complete if parentheses are not allowed So, in this part, update the function infix to postfix() to handle parentheses ... s t a c k v a l u e s , new token (OPERAND, v a l u e ) ) ; default : f r e e ( ptoken ) ; /∗ f r e e to ken ∗/ break ; } i ++) { } /∗ r e t u r n v a l u e i s on top o f s t a c k ( s h o u ... � � � � "an" � � � � "and" "ca" � � � � � � � � "ant" "cat" Figure 6. 2 -1: Trie structure (translations not shown) For each node, its key (e.g and ) is not explicitly stored in the node; instead,...
• 8
• 211
• 0

## Problem Set 6 Part 2: Function pointers, hash table

... MIT OpenCourseWare http://ocw.mit.edu 6. 087 Practical Programming in C January (IAP) 2010 For information about citing these materials...
• 2
• 91
• 0

Xem thêm