Popular

    Introduction to the binary search tree and its operations
    Study of recurrences and their use in determining the time complexity of recursive algorithms
    Introduction to binary trees
    Analysis of a sorting algorithm (insertion sort)
    Introduction to a method of proving mathematical statements (induction)
    Design and implementation of a stack in C
    Review of stacks and queues and an analysis of their implementations.
    Analysis of the different implementation of the list ADT and the time complexities associated with its operations.
    Introduction to the heap abstract data type and its use in implementing priority queues
    A quick review of linked lists in preparation for the exercises