/Data-structures---SD

sorting algorithms, BSTs, AVL trees, skip lists, heaps, treaps, etc.

Primary LanguageC++

Data-structures

1st year, 2nd semester, a course taught by Dumitran Marius

This course went through:

  1. Sorting algorithms see Project 1: an analysis of different sorting algorithms and their complexities

  2. Linear data structures:

  • Linked Lists
  • Queues
  • Stacks
  • Deques
  • Heaps:
    • Proprity Heaps
    • Binomial Heaps
    • Fibonacci Heaps
    • Treaps ( you can see my inplementation of Treaps here: Project 2 )
    • Huffman Codes (you can see my presentation on the Optimality of Huffman Codes here: Presentation )
  1. Binary Search Trees:
  • BSTs
  • AVLs
  • Skip Lists
  1. Segment Trees
  • Square Root Decomposition Technique
  • Segment Trees
  • Range Minimum Query
  • Lowest Common Ancestor
  1. Hashing

My 3rd and final project for this course was solving about 50 problems on the topics the course went through. You can see the project here: Project 3