You are here:

Data structure animation tutorial
THESIS

, Concordia University , Canada

Concordia University . Awarded

Abstract

This study is an animation tutorial for the people who wants to learn the Data Structure. The emphasis is placed on vivid animations to help the people to understand algorithms for data structure easily. Some of the implementations to be addressed are: stack (Array-Based Stack, Linked Stack), queue (Array-Based Queue), List (Circular Linked List, Double Linked List, Linear Linked List), sort (Quick Sort, Merge Sort, Bubble Sort, Shell Sort, Insertion Sort, Heap Sort, Radix Sort, Selection Sort), heap (Priority Queue, Heap Build, Heap Sort), recursive (Tower of Hanio), hashing (Open Hashing, Close Hashing) binary search (Loop, Recursive), tree (2–3 Tree, Huffman Tree, Binary Search Tree, Balance Tree). Conclusions are formulated in terms of further work to be accomplished in order to better help understanding the completed algorithm.

Citation

Sun, Y. Data structure animation tutorial. Master's thesis, Concordia University. Retrieved December 16, 2019 from .

This record was imported from ProQuest on October 23, 2013. [Original Record]

Citation reproduced with permission of ProQuest LLC.

For copies of dissertations and theses: (800) 521-0600/(734) 761-4700 or https://dissexpress.umi.com

Keywords