Hi all.

not been on for a while and as your help was so good last time, I was hoping you could lend me your views again.

Simple question, absolutely no code involved.

I'm trying to identify ways in which the follwoing ADT's could be used in a Real World environment.

Stacks

Queues

Linked Lists

Square Linked Lists

Binary Tree.


I have the following scenarios and any ideas you wanna throw in would be most useful.

Stack - ?? stuck on this one.

Queue - Could be used as a holding file for a print job. Airport take-off & landing scenario

Linked Lists - for holding data in ascending/descending order as easy to search through using Binary Search

Square Linked Lists - Same use as above, but used with much more data.

Binary Tree - ?? but suppose somert like storing phone book details as they a search on this type of data structure is very quick.


Any comments/additions most welcome.
And it's not got any of my 'bad' code in to analyse.


by the way, the reason I ask is this question may appear on my exam paper next week. Just trying to get a good foundation.

the_crazyman

Anyplace where you need to store information received and retrieve the information from the last info stored. A really common example is analyzing and breaking apart a math equation. Say you have the following equation:
2 + 3 * 1 + 8 - 3
and are to 'disassemble' the equation and executed from the right to left.
2 stacks are involved, operaors and operands. Store each number and operator on their respective stack as you move thru the equation:
operand gets: 2 3 1 8 3
operator gets: + * + -
Now you
1) remove them from the stack, 2 numbers per operator
2) perform the calculation
3) put the answer back on the stack:

IOW, retrieve 8, 3, - (8 - 3) and get 5. Put that back on the stack:
operand has: 2 3 1 5
operator has: + * +

Repeat til done.

Another stack example: a simple pile. Your bills start arriving. They go in a pile until you're ready to pay them. When that time comes, you take the top bill and write the check. Then the next. And so on until the money runs out. You can't look thru the bills, that would not be a stack.


Line at the grocery store...


For adding data in an ordered way that is easy to traverse (follow the path). Each node can only have 2 subsequent nodes, one greater and one less. If the data (key) is less than the current node, you look at the sub-node to the left. Greater to the right. When you get to the point there is no node, you add the data there, creating the node.
If you are adding j you'd look at:
1) k, move down left (j < k)
2) d, move down right (j > d)
3) i, move down right (j > i)
4) no node there, so add j to the right of i

__________________

Got a cough? Go home tonight and eat a whole box of Ex-Lax. Tomorrow, you'll be afraid to cough.
-- Pearl Williams

here is some example...

Stack - A deck of card in card games like poker or solitare, also used alot in language processing, simple example writing strings backward.

Queue - every message fired by a windows application is queued in the Windows Message Queue. or cars lining in a toll booth.

Binary Tree - decision tree in AI application (dining decision example), parentage tree, space partitioning in harddisk or a game I used to play before where you devide the space given in binary and trap the bouncing ball in the space to the samllest space.

__________________
When you say "I wrote a program that crashed Windows," people just stare at you blankly and say "Hey, I got those with the system, for free." Linus Torvalds

cheers for the above

much appreciated and stored in the old brain matter.

Exam next week, will let you know how badly/well I do.