Skip to Main Content
| Brooklyn College Library & Academic IT |CISC Department

CISC 3130 Data Structures: Data Structures

Professor Chuang Spring 2020 OER

What are Data Structures?

What are data structures?

  • A data structure is an arrangement of data in a computer’s memory
  • We refer to them as abstract representations used to talk about logistics of low level data management and retrieval
  • Examples of data structures include stacks, queues, lists and trees

Data Structures & Algorithms

  • Algorithms refer to the logistics in manipulating data in these structures, such as searching or sorting.
  • Data structures & algorithms go hand in hand, let’s focus on data structures first to know what we’re dealing with.

Data Structures

  • Arrays (container object in Java)
  • Linked Lists
    • Simple Linked List
    • Double Ended Linked List
    • Doubly Linked List
    • Sorted Linked List
  • Hashmaps
  • Binary Trees
    • Binary Search Tree
    • Heap
  • Graphs

 

Suggested Reading

 

Topic Chapter
Arrays
 		 Lafore Ch 2
Stacks & Queues Lafore Ch 4,
CLRS Ch 10
Linked List Lafore Ch 5,
CLRS Ch 10
Binary Trees, BST Lafore Ch 8,
CLRS Ch 12
Heaps Lafore Ch 12
Graphs Lafore Ch13

 

Overview

Data Structures

Time Complexity

 

Data Structure Search Insertion Deletion Traversal
Array O(n) O(1) O(n)  
Stack   O(1) O(1)  
Queue   O(1) O(1)  
Linked List O(n) O(n) O(n) O(n)
Binary Search Treee O(logn) O(logn) O(logn) O(n)
HashMap O(1) O(1) O(1)  

Creative Commons License NC SA 4.0 icon This OER resource is released under Creative Commons Attribution-Non Commercial-ShareAlike 4.0 International License. It was made for the Spring 2020 semester by Professor Katherine Chuang on Data Structures at Brooklyn College, Department of Computer and Information Science.