VERS003VERS003  \j     +  8 *K-) ;%.(31#/ '0:J?9=>AGCF<DIH E&$2!B576@"4,K??@3 3@ _@5j Linked Lists6 Linked Lists@;Linked List, Defined List, Defi,Single Linked Listle Linked Lisp\Name New Concept HereA@8@lDouble Linked ListNA@v@W Stack@\6A NA@v@oQueue@\6A NA@v@s z Binary TreeA N A@v@rLPointer\7A N A@v@LData@\7A N A@v@ ,Memory =faster access than disk NCan sort data in order A@v@4Head, single listd, single list&Null, single listl, single list,Members, single lists, single lAddress databaseA NA@v@n Escalator7zA NA@v@ Head, double listd, double list Members, double listA@v@ Tail, double list NA@v@ eNull, double list NA@v@eMembers, stackA NA@v@,TopFFKTop2A̺fURPoint last to new廻?̺fV To the top 廻@̺fupPoint new to top廻A̺fuA To a nodeZ廻B̺f^ Point node to new廻C̺f`CPoint previous to nextevious toak Remove Member廻E̺fnPoint previous to neF̺fgPoint next to previousG̺fhZPoint top to next member̺fjGPoint tail to next廻I̺fm_Point last node to null̺fqm Delete nodez廻K̺fr^?0l6?0H˪2,4@?0H?1e@d3A@ _Ne ?1e@d3A@ _Ne ,l6?0l4?`4Hl,0,6F??,?2@d33@ _N?1?2@d33@ _N?1k> @ n6@0;NLLzzz?3@d33@ _N?2?3@d33@ _N?24JE?Hl8?,J?,L`Hl40?4@d33@ _N?3?4@d33@ _N?3`THl40,NF?0,HG2-@E??53@d33@ _N?4?53@d33@ _N?4G0l4?NLN^ _PON!INTER?6.@d33@ _N?5?6.@d33@ _N?5IHzvHnؕN.ؕg Hz0N` m?7.@d33@ _N?6?7.@d33@ _N?6opource.DisplayIconPicture: GetRe?8@d33@ _N?7?8@d33@ _N?7n, _Cp"Q؟-؋gBgHn0m?9@d33@ _N?8?9@d33@ _N?8 & -Ag?,&Hl,NXHmHl?10@d33@ _N?9?10@d33@ _N?9 g-- g".gHl,<N:Hl?11@d33@ _N?10?11@d33@ _N?10 $>v?"~0>??2AA%@./=BB</D,D4.E./EFF2BGGXZ6XK7YfJ58n59LL5:MMn6;Nn68OLO.6<PP<6=QQn/78PRz7>TT7?UU5NXK6RYW7ViXnkr]r[I@ B6_YB8`T^BC_TD>SbmcdEaaFDfGggEfhhHEie-EijjIHl-Elmm@l`5JWoJ ^nK qq-@onp8@_ssgA@tt%rA grouping of like pieces of data, each of which is connected to at least one other piece of data in the grouping b7@@6@1@@d Li $ Linked List1 870x@6@1@@1@ (p1 8|st L@pCODE concept A grouping of like pieces of data. Each data member in the grouping points to at least one other data member in the grouping .i 1@@u $ Linked List1 855,@41@@1@ (p1 8|sts6 L@pCODE concept kComputer information. In an address database, a person's last name would be an example of a piece of data.14@@@ i 1@@u $@ 11 855a@4P1@@1@ (p1 8|s2@@pCODE concept `A message that "points to," that is, describes the location in memory, of another piece of data.E@ b6@ @2B1@@er\ $A N A1 82ψx@2B1@@1@ (p1 8|7@pCODE concept NA Linked List in which each data member points to the next member in the list.@05(115(@@ i<1@@e Li $ Listle Link1 85p5@5(1@@1@ (p1 8|nked L@pCODE concept APoints to the first member. No other member points to the head. 3@`@@05 115 @@ i<1@@d Li $ Linked List1 85`5@501@@1@ (p1 8|st L@pCODE concept KIn a single linked list, each member of the list points to its next member."04114@@ i 1@@u $kA NA1 8552@41@@1@ (p1 8|stack@pCODE concept 4The last member is set to point to null, or nothing.@`13@`@@CODE@ b2@ @51@@er\ $A N A1 85x@51@@1@ (p1 8|7@pCODE concept dA single linked list is like an up escalator in that once you leave a step, you cannot go back down.5f0115f0@@ i<1@@le o $@ 11 85`5@5f@1@@1@ (p1 8|f2@@pCODE concept yA Linked List in which each data member points to the next member in the list, as well as the previous member of the list@ i 1@@u $A NA1 8555@41@@1@ (p1 8|7z@pCODE concept _The head points to and is pointed to by the first member. No other member points to the head. 0561156@@ i<1@@ dou $listd, doubl1 8505@561@@1@ (p1 8|ble li@pCODE concept Each member points to the next member AND the previous member. (The first member points to the head. The last member points to the tail.), $eA N#A1 85`50@5]1@@1@ (p1 8|queue@pCODE concept DThe tail points to and is pointed to by the last member of the list.@`"04ܡ114ܡ@@ i 1@@u $list NA1 8555p@41@@1@ (p1 8|ble li@pCODE concept DThe first member and the last member both point to null, or nothing.@`@@05K 115K @@ i<1@@ sin $listl, singl1 8505 @5K01@@1@ (p1 8|gle li@pCODE concept A stack is type of list sometimes called "LIFO," "Last in First Out. " Members are added to the top, then removed from the top. 1@@@\ $A NA1 85x@51@@1@ (p1 8|6@pCODE concept A double linked list is like an elevator. You can move up and down. Once you leave a floor, you can retrace your path to go back to that floor.A NA1 86/5@5p1@@1@ (p1 8|5vZ@pCODE concept UDishes are placed on top of other dishes. They are removed from the top of the pile.@06116@@ i<1@@ of $esA NA1 877D@61@@1@ (p1 8|dishes@pCODE concept A queue is type of list sometimes called "FIFO," "First in First Out. " Members are added to the top, then removed from the bottom. u $A NA1 8550@4@1@@1@ (p1 8|6@pCODE concept eA queue is like a ticket booth, because the person in line longest is the next to receive the ticket.401140@!@ i 1@@u $A N!A1 855&0@4@1@@1@ (p1 8|oth@pCODE concept -Points to the last member added to the queue.@`13@`@@05Y115Y@@ i<1@@stac $A NA1 85`5@5Y1@@1@ (p1 8|k5Z@pCODE concept {Each member points to the previous member. (Queues can also be double linked, so that they also point to the next member.)@ i<1@@rs, $le lists, si1 855V@4 1@@1@ (p1 8|single@pCODE concept PThe tail points to the first member that was added, or the bottom for the queue.@05y115y@!@ i<1@@t bo $A N!A1 85`5@5y1@@1@ (p1 8|oth@pCODE concept dA binary tree is a type of double linked list. In it, each member can point to two other members. 4͡114͡@@ i 1@@u $ard and back1 8559@41@@1@ (p1 8|forwar@pCODE concept dA binary tree looks like a genealogy chart, in which each child points to her mother and her father.401140@@ i 1@@u $@ 11 8540@4@1@@1@ (p1 8|2@@pCODE concept mThe first element of the list. Because no other elements point to it, it looks list the "trunk" of the tree.155@@&@ i<1@@@\ $A N&A1 85`5@@55P1@@1@ (p1 8|5vZ@pCODE concept A member of the binary tree." DL@u@`13@`@@05 115 @@ i<1@@ dou $list NA1 8505} @501@@1@ (p1 8|ble li@pCODE concept ;A node, or member, which does not point to any other nodes.13@`@@05*115*@@ i<1@@׏! $LIFO@11 8505@5*1@@1@ (p1 8|}f4L@pCODE concept ?First member of the stack was the first in. It points to null.3@`@@05a115a@@ i<1@@ mem $, stackA1 8505@5a1@@1@ (p1 8|bers, @pCODE concept Each member points to the member before it. (Stacks can also be double linked so that the also point to the member before them.)1@@u $r access tha1 855n@5 1@@1@ (p1 8|aster @pCODE concept 6The top points to the last member placed in the stack.@`13@`@@CODE@ b2@@51@@stac $A NA1 85x@51@@1@ (p1 8|k5Z@pCODE concept A programming structure that allows information of different types to be stored together. For example, a data structure might allow a character and an integer to be stored together. @@HP5@5@ 0(̺f concept A programming structure that only allows information of the same type to be stored together. For instance, an array might contain a grouping of 5 integers, or 5 character strings to be stored together. ť5@5@ 0(@v@ concA pointer to the first memberL@"" IPKh`43`@CODE. KhH̺L`5@. ʊHeadE(P`5@5@ 0(̺f concept A unit in the list, which points to other members. In a single list it points to only one member. In a double linked list, it points to two members. tha ʊskMember(P`5@5@ 0(n disk concept ONothing, "grounded to zero." What the last member of the data set points to. 43`@CODE KhF@N dou`5@A ʊ@NullE(P`5@5@ 0(@v@ concept EThe tail points to and is pointed to the last member of the data set.`43`@CODE! Kh1 Tt bo`5@!A ʊ@Tail(P`5@5@ 0(@v@ concept )Points to the last member that was added."" IPKh`23`@CODE Kh` UBeca5@N ʊseTopE(?5@5@ 0( Use concept