Data Structures and Algorithms - Chapter 3 -STACK ppt

... <integer> data <array of <DataType>>End Stackx x x x xxn count data 0 1 2 3 n-2 n-1 max-2 max-1Stack with pre-defined maxsize and has n elements.n -1 topPhysical…25push poppush ... element).15counttop1pNewcounttop0pNewpNew->link = top top = pNewcount = count + 1Push Algorithm (cont.)<ErrorCode> Push (val DataIn <DataType>)Pushes new data into the stack.Pre DataIn contains data to be ... Allocate pNew2. If (allocation was successful)1. pNew-> ;data = DataIn2. pNew->link = top 3. top = pNew4. count = count + 15. return success 3. Else1. return overflowend Push17pNewcounttopn+1X…counttop1pNewPop...

Data Structures and Algorithms - Chapter 3 -Stack Applications pdf

... f)*gabc*+de++*+( - ( - *+ - *( - *( - InfixPostfixa+b*c- (d*e / f)*gabc*+de*a+b*c- (d*e / f)*gabc*+de*fa+b*c- (d*e / f)*gabc*+de*f/a+b*c- (d*e / f)*gabc*+de*f/a+b*c- (d*e / f)*gabc*+de*f/g/( - - /( - * - Postfixabc*+de*f/g *- * - Process ... f)*gabc*+a+b*c-(d*e / f)*gaa+b*c-(d*e / f)*gabc*+a+b*c-(d*e / f)*gaba+b*c-(d*e / f)*gabc*+da+b*c-(d*e / f)*gaba+b*c-(d*e / f)*gabc*+da+b*c-(d*e / f)*gabca+b*c-(d*e / f)*gabc*+de++*+( - ( - *+ - *( - *( - InfixPostfixa+b*c- ... 5 - 2 4 6 + * 5 - 2 4 6 + * 5 - 2 4 6 + * 5 - 242642Postfix2 4 6 + * 5 - 2 4 6 + * 5 - 2 4 6 + * 5 - 2 4 6 + * 5 - 1510*2 = 20201024+6 =10Evaluate a Postfix Expression5202 0-5 ...

Data Structures and Algorithms - Chapter 7 -Tree pptx

... tree)Record Data <DataType>Parent <DataType>Flag <ChildType>End RecordBinaryTree Data <Array of <Record> >End BinaryTree012 3 456 Data ABECFGH Parent - ABACCF ... not NULL)1. recursive_postOrder(subroot->left)2. recursive_postOrder(subroot->right) 3. Operation(subroot-> ;data) End recursive_postOrder 30 Depth-First Traversal<void> preOrderTraverse ... Search (ref DataOut <DataType>)<ErrorCode> Insert (val DataIn <DataType>)<ErrorCode> Remove (val key <KeyType>)<ErrorCode> Retrieve (ref DataOut <DataType>)15Depend...

Data Structures and Algorithms - Chapter 8: Heaps pptx

... else1. MinData = Data[ 0]2. Data[ 0] = Data[ count -1 ] 3. count = count - 14. ReheapDown(0, count -1 )5. return successEnd DeleteHeap16<ErrorCode> DeleteHeap (ref MinData <DataType>) ... (heap is not full) AND (more data in listOfData)1. listOfData.Retrieve(count, newData)2. data[ count] = newData 3. ReheapUp( count)4. count = count + 1 3. if (count < listOfData.Size() )1. ... that position. 31 31 31 31 Delete minimum element from min-heap15The element in the last position is put to the position of the root, and ReheapDown is called for that position. 31 <ErrorCode>...

Data Structures and Algorithms - Chapter 9: Hashing pot

... Hoang TruCSE Faculty - HCMUTMid-squareAddress = middle digits of Key2• Example:9452 * 9452 = 8 934 030 4 → 34 03 2101 December 2008Cao Hoang TruCSE Faculty - HCMUTMid-square• Disadvantage: ... Hoang TruCSE Faculty - HCMUTPseudorandom• Example:Key = 121267 a = 17 c = 7 listSize = 30 7Address = ((17*121267 + 7) MOD 30 7 + 1= (2061 539 + 7) MOD 30 7 + 1= 2061546 MOD 30 7 + 1= 41 + 1= ... Example:Numbering system to handle 1,000,000 employees Data space to store up to 30 0 employees hash(121267) = 121267 MOD 30 7 + 1 = 2 + 1 = 3 1901 December 2008Cao Hoang TruCSE Faculty - HCMUTDigit ExtractionAddress...

Data Structures and Algorithms - Chapter 6 -Recursion pot

... write (head-> ;data) 3. Print(head->link) // recursive caseEnd Print18Print List in Reverse19 Chapter 6 - Recursion Subprogram implementation Recursion Designing recursive algorithms  ... Backtracking Examples of backtracking and recursive algorithms:  Factorial Fibonacci The towers of Hanoi Eight Queens Problem Tree-structured program: Look-ahead in Game1Print List in Reverse20Print ... PrintReverse.1. if (head = NULL) // stopping case1. return2. PrintReverse(head->link) // recursive case 3. write (head-> ;data) End PrintReverse21Factorial: A recursive Definition22Iterative...

Data Structures and Algorithms - Chapter 10: Sorting docx

... 1.19 Chapter 10 - Sorting1Choosing incremental valuesIncremental values may be: 1, 4, 13, 40, 121, kt= 1ki-1= 3 * ki+ 1t = |log 3 (n)| -1 or : 1, 3, 7, 15, 31 , kt= 1ki-1= ... < count )1. temp = data current2. walker = current-1 3. loop (walker >=0) AND (temp.key < data walker.key)1. data walker+1= data walker2. walker = walker -1 4. data walker+1= temp5. ... count)1. temp = data[ current]2. walker = current - k 3. loop (walker >=0) AND (temp.key < data[ walker].key)1. data[ walker + k] = data[ walker]2. walker = walker – k4. data[ walker + k]...

Data Structures and Algorithms - Chapter 12: Multiway trees pdf

... > position)1. subroot-> ;data i= subroot-> ;data i - 12. subroot->branchi + 1= subroot->branchi 3. i = i + 1 3. subroot-> ;data position= entry4. subroot->branchposition + ... 1011M-Way Search Tree12 13 1415B-Tree1617B-Tree Insertion18B-Tree Insertion19 Chapter 12 Lexicographic Search Trees: Tries Multiway Trees B-Tree, B*-Tree, B+-Tree Red-Black ... (root, newData, median, rightBranch)2. if (result = overflow)1. Allocate newroot2. newroot->count = 1 3. newroot-> ;data 0= median4. newroot->branch0= root5. newroot->branch1=...

Data Structures and Algorithms - Chapter 12: Multiway trees doc

... entryNdx + 1)1 node -& gt; entries[shifter] = node -& gt; entries[shifter - 1]2 shifter = shifter - 1 3 node -& gt; entries[shifter] = newEntry4 node -& gt; numEntries = node -& gt; numEntries + ... Faculty - HCMUTB-Tree Insertion11 else1 insertEntry (rightPtr, entryNdx − minEntries, upEntry)2 node -& gt; numEntries = node -& gt; numEntries − 1 3 rightPtr -& gt; numEntries = rightPtr -& gt; ... Faculty - HCMUTB-Tree DeletionDelete 78 63 11 14 7421 78 85 63 11 14 7421 85Delete 63 63 11 14 7421 852111 7414 852117 November 2008Cao Hoang TruCSE Faculty - HCMUTB-Tree DeletionDelete...

Xem thêm