Algorithms-and-Data-Structures-I

  • Linear lists: sequential, simply and doubly linked, static and dynamic, circular.
  • Stacks and queues.
  • Applications.
  • Sparse matrices.
  • Generalized lists and applications.
  • Non linear lists: trees, binary trees.
  • Representation of trees.
  • Search trees and balanced binary search trees (AVL).
  • Development of algorithms on binary trees.