Skip to content

Instantly share code, notes, and snippets.

@bgveenstra

bgveenstra/week-9-objectives.md

Last active April 7, 2017 14:30
Show Gist options
  • Save bgveenstra/86ac1eca6c755d34ba9d8763c8850b92 to your computer and use it in GitHub Desktop.
Save bgveenstra/86ac1eca6c755d34ba9d8763c8850b92 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
week-9-objectives.md

Week 9 Learning Objectives

Linked Lists

  • Describe the low-level structure of arrays and linked lists.
  • Manipulate linked lists.

Stacks

  • Describe a stack by its methods and last in, first out (LIFO) behavior.
  • Build stack methods using linked list methods.

Queues

  • Describe a queue by its methods and first in, first out (FIFO) behavior.
  • Build queue methods using linked list methods.
  • Compare and contrast stacks and queues and appropriately choose which is better for a given situation.

Hashmaps

  • Describe and draw the structure of a hashmap.
  • Explain properties of a good hash function.
  • Perform runtime analysis on the hashmap data structure.

Trees

  • Explain the relationship between graphs, trees, and binary search trees.
  • Draw a balanced binary search tree from some given data.
  • Use binary search trees in answering interview style challenge questions.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment