•data structures using c: 3.3: expanding and contracting lists-(2013/11/20)

data structures using c: 3.3: expanding and contracting lists-(2013/11/20)

data structures using c: 3.3.1 insertion-(2013/11/20)

data structures using c: 3.3.2 special cases-(2013/11/20)

data structures using c: 3.3.3 header records-(2013/11/20)

data structures using c: 3.3.4 deletion-(2013/11/20)

data structures using c: 3.4: traversal of lists-(2013/11/20)

data structures using c: 3.4.1 list reversal using a loop-(2013/11/20)

data structures using c: 3.4.2 a general list traversal using a loop-(2013/11/20)

data structures using c: 3.4.3 the merits of functional modularization-(2013/11/20)

data structures using c: 3.5: using the traverse function for lists-(2013/11/20)

data structures using c: 3.5.1 why traverse was useful-(2013/11/20)

data structures using c: 3.6: implementing lists-(2013/11/20)

data structures using c: 3.6.1 lists stored in dynamic memory-(2013/11/20)

data structures using c: 3.6.2 lists stored in an array of records-(2013/11/20)

data structures using c: 3.6.3 lists stored in languages without recor-(2013/11/20)

data structures using c: 3.7: keeping track of available records-(2013/11/20)

data structures using c: 3.7.1 why dynamic memory?-(2013/11/20)

data structures using c: 3.7.2 using dynamic memory-(2013/11/20)

data structures using c: 3.8: sequential arrays versus lists for recor-(2013/11/20)

data structures using c: 3.9: case study: merging and the perfect shuf-(2013/11/20)

data structures using c: 3.9.1 the perfect shuffle-(2013/11/20)

data structures using c: 3.9.2 array implementation of the perfect shu-(2013/11/20)

data structures using c: 3.9.3 list implementation of the perfect shuf-(2013/11/20)

data structures using c: 3.9.4 merging sequences of entries-(2013/11/20)

data structures using c: exercises-(2013/11/20)

data structures using c: suggested assignments-(2013/11/20)

data structures using c: chapter 4: introduction to recursion, stacks,-(2013/11/20)

data structures using c: 4.1: what is recursion?-(2013/11/20)

data structures using c: 4.2: using recursion-(2013/11/20)

data structures using c: 4.2.1 the towers of hanoi-(2013/11/20)

data structures using c: 4.2.2 verifying and simulating a recursive pr-(2013/11/20)

data structures using c: 4.2.3 the length of a list-(2013/11/20)

data structures using c: 4.2.4 copying a list-(2013/11/20)

data structures using c: 4.2.5 local and global variables and paramete-(2013/11/20)

data structures using c: 4.2.6 counting squares-(2013/11/20)

data structures using c: 4.2.7 permutations-(2013/11/20)

data structures using c: 4.3: a close look at the execution of recursi-(2013/11/20)

data structures using c: 4.4: implementing recursive programs-(2013/11/20)

data structures using c: 4.4.1 a sample implementation of towers-(2013/11/20)

data structures using c: 4.4.2 a sample implementation for permutation-(2013/11/20)

data structures using c: 4.5: stacks-(2013/11/20)

data structures using c: 4.5.1 array implementation of a stack-(2013/11/20)

data structures using c: 4.5.2 list implementation of the stack with a-(2013/11/20)

data structures using c: 4.5.3 list implementation of the stack with r-(2013/11/20)

data structures using c: 4.6: evaluation and translation of expression-(2013/11/20)

data structures using c: 4.6.1 postfix expressions-(2013/11/20)

data structures using c: 4.6.2 infix expressions-(2013/11/20)

data structures using c: 4.6.3 translating infix to postfix-(2013/11/20)

data structures using c: 4.7: queues-(2013/11/20)

data structures using c: 4.7.1 array and circular array implementation-(2013/11/20)

data structures using c: 4.7.2 list implementation of the queue with a-(2013/11/20)

data structures using c: 4.7.3 list implementation of the queue with r-(2013/11/20)

data structures using c: 4.8: case study: checking sequences for prope-(2013/11/20)

data structures using c: exercises-(2013/11/20)

data structures using c: suggested assignments-(2013/11/20)

data structures using c: chapter 5: packaging data abstractions-(2013/11/20)

data structures using c: 5.1: data abstraction revisited-(2013/11/20)

data structures using c: 5.2: the prime example-(2013/11/20)

data structures using c: 5.3: stable marriages-(2013/11/20)

data structures using c: 5.4 : a list example-(2013/11/20)

data structures using c: 5.5: a stack example-(2013/11/20)

data structures using c: 5.6: summary-(2013/11/20)

data structures using c: exercises-(2013/11/20)

data structures using c: suggested assignments-(2013/11/20)

data structures using c: chapter 6: more complex lists-(2013/11/20)

data structures using c: 6.1: imposing list structure on data-(2013/11/20)

data structures using c: 6.1.1 a definition of list-(2013/11/20)

data structures using c: 6.2: traversal of list-(2013/11/20)

data structures using c: 6.2.1 an iterative function-(2013/11/20)

data structures using c: 6.2.2 a recursive function-(2013/11/20)

data structures using c: 6.3: using a traverse function for list-(2013/11/20)

data structures using c: 6.4: implementing list-(2013/11/20)

data structures using c: 6.4.1 sharing storage-(2013/11/20)

data structures using c: 6.5: case study: information retrieval-(2013/11/20)

data structures using c: 6.5.1 family relationships-(2013/11/20)

data structures using c: 6.5.2 a first solution-(2013/11/20)

data structures using c: 6.5.3 a better solution-(2013/11/20)

data structures using c: 6.5.4 updating the system-(2013/11/20)

data structures using c: 6.5.5 retrieving information from the system-(2013/11/20)

data structures using c: 6.5.6 other system components-(2013/11/20)

data structures using c: 6.5.7 case study overview-(2013/11/20)

data structures using c: exercises-(2013/11/20)

data structures using c: suggested assignment-(2013/11/20)

data structures using c: chapter 7: trees-(2013/11/20)

data structures using c: 7.1: branching out-(2013/11/20)

data structures using c: 7.1.1 depth versus capacity*-(2013/11/20)

data structures using c: 7.2: trees of records-(2013/11/20)

data structures using c: 7.2.1 insertion and deletion of records in bi-(2013/11/20)

data structures using c: 7.2.2 climbing binary trees-(2013/11/20)

data structures using c: 7.2.3 three preorder traversals of a binary t-(2013/11/20)

data structures using c: 7.3: using the traverse functions for binary-(2013/11/20)

data structures using c: 7.4: implementing binary trees-(2013/11/20)

data structures using c: 7.4.1 sequential representation-(2013/11/20)

data structures using c: 7.4.2 linked representation-(2013/11/20)

data structures using c: 7.4.3 list-(2013/11/20)

data structures using c: 7.5: trees-(2013/11/20)

data structures using c: 7.5.1 implementing trees as binary trees-(2013/11/20)

data structures using c: 7.6: traversals of trees-(2013/11/20)

data structures using c: 7.6.1 obtaining the binary tree for a tree-(2013/11/20)

data structures using c: 7.6.2 backtracking: the n-(2013/11/20)

data structures using c: 7.6.3 depth-(2013/11/20)