Skip to main content
Practice

Review of Key Data Structures

Let's review the key data structures we've covered in previous lectures.

Stack​

  • A data structure that follows the Last In First Out (LIFO) method, where the most recently added data is the first to be removed.

Queue​

  • A data structure that follows the First In First Out (FIFO) method, where the earliest added data is the first to be removed.

Linked List​

  • A data structure consisting of Nodes that contain data and are linked together by Pointers.

Hash Table​

  • A data structure that maps Keys to Values and uses a hash function to determine the storage location of the keys.

Want to learn more?

Join CodeFriends Plus membership or enroll in a course to start your journey.