Ordered Data Structures

Description

Course 2 of 3 in the Accelerated Computer Science Fundamentals Certification on Coursera.

I'm using this repo to track my progress through the course.

Accelerated CS Fundamentals Certification - University of Illinois Urbana Champlain via Coursera

• Course 1: Object-Oriented Data Structures in C++
  • Link to my github repo for this course here
• Course 2 (this one): Ordered Data Structures
  • Link to my github repo for this course here
• Course 3: Unordered Data Structures
  • Link to my github repo for this course UPCOMING

Link: Github repo for source files used in all 3 courses in the Accelerated CS Fundamentals Certification

---

Week 1: Orientation and Linear Structures

• Linked Lists
• Queues
• Stacks
• Big O Notation and run-time analysis
• Project: Insert Node into linked list, merge 2 linked lists

Week 2: Introduction to Tree Structures

• Intro to Trees
• Binary Trees
• Tree Traversals
• Binary Search Trees (BST)
• BST Analysis
• Challenge: Count nodes in a BST without using recursion or a stack

Week 3: Advanced Tree Structures

• Balanced Binary Search Tree (BST)
• AVL Trees
• B-Trees
• B-Tree Insert
• B-Tree Search
• Challenge: Create function to calculate height of each node in a binary tree
• Project: Generic Tree Order Level Traversal

Week 4: Heap Structures

• Heap Intro
• Heap Insert
• Heap RemoveMIN
• Heap BuildHeap
• Heap Runtime Analysis
• Challenge: Create function to create a min heap with downHeap swapping

---

Certificate of Completion - 10/6/2019