A heap is a data structure in the form of a balanced binary tree with a special constraint that will be introduced in the followings. In the tree, each node contains a key and two references to two child nodes. The key represents a value, which is normally an integer since every data type in […]
This post is a summary for the upcoming final exam of Data structure in Computer Science course in Fall, 2014. Summary Range of the final exam Chapter 8?15 in the text book. About chapters Chapter 8: Queues *** Chapter 9: Recursive Thinking *** Chapter 10: Trees ****< Chapter 11: Tree Projects **** Chapter 12: Searching […]
Definitions of Data Structures In computer science, a data structure is a particular way of organizing data in a computer so that it can be used efficiently. Types of data structures Abstract data structures associative array, map, symbol table, or dictionary list stack queue deque(doubly ended queue) priority queue set arrays linked lists one-way linked […]