Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword or section
Like this
0Activity

Table Of Contents

Stack and queue interfaces
The classic Tower of Hanoi problem
Anagrams
Evaluating postfix expressions
STRUCTURED NATURAL LANGUAGE DESIGN for evaluating a postfix expression
Converting infix notation to postfix notation
Linked-arrays implementation for faster execution
Efficiency
A better implementation of queues
The enqueue method
The Node class
Nodes in a NodeStack object
Implementing queues with linked lists
The ListADT definition
But wait! There's more!
Limits of recursion
Coding the NodeList subclass of ListADT
Coding NodeList's pop method
Using zero-based indexes
Searching for the index of a data value
Iterating through a ListADT
An application using NodeLists
Implementing the CardList class
STRUCTURED NATURAL LANGUAGE DESIGN for removeTheFirstSucceeds
Coding the DoublyLinked class
Backing structures
Linked lists with header nodes
Further variations
The Josephus Problem
The web-link problem
The WebList class
STRUCTURED NATURAL LANGUAGE DESIGN for WebList's addLink
Stack objects (from java.util)
0 of .
Results for:
No results containing your search query
P. 1
chap14

chap14

Ratings: (0)|Views: 2 |Likes:
Published by Jigar Patel
chap14
chap14

More info:

Categories:Types, School Work
Published by: Jigar Patel on Jul 01, 2013
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

07/01/2013

pdf

text

original

You're Reading a Free Preview
Pages 5 to 42 are not shown in this preview.

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->