Types of Data Structures - General Knowledge

Types of Data Structures - General Knowledge

1. Array

   • Arrays have an index system, like the C family's Arrays.
   • arrays would normally look like:
     • int array[5] {1, 2, 3, 4, 5}
       • is actually int array[5] {0, 1, 2, 3, 4}
     • Arrays start with a index of 0 because binary works in 0s and 1s.
       • so the array "array" would hold value 1 at an index of 0, and value 5 at an index of 4.
   • There are "2d" and "3d" arrays as well.
     • Example of a 2d array followed by a 3d array
       • int 2d = [[0, 0],[0, 1]
       • int 3d = [[0, 0],[0,1],[0,2]]

2. LINKED Lists

   • A sequence of possibly different data types, and each element is linked to the next.
   • Terms for LINKED Lists:
     • Next- Each link contains a Link called "next", which leads to the next element.
     • Link - Each element in a linked list can store a piece of data called an "element".
     • Linkedlist - A linked list contains the connection link to the first link, which is called "First".
   • the end of a linked list's "next" contains a null value to signal the end of the list.

3. Stack

   • A stack is an Abstract Data Type.
   • Stacks are like a pile of books - you can only take one from the top of the pile.
   • Stacks use a Last-In-First-Out operation order. This means that whatever the last object is in the stack, it will have to be the first to come out of the stack.
   • An example of a stack is a nested conditional statement.

4. Queue

   • Queues are like one-way traffic jams. The person at the front of the queue gets to leave first, but the person at the back of the queue is stuck, as are the people in the middle - neither can leave, but the person who is the last in the queue can still be accessed.
   • The first in a queue is "Enqueued".
   • The last in a queue is "Decueued"