CSIT 341 Data Structures
Review basic data structures and algorithmic complexities; sorting; generalized lists; binary trees; binary search trees; tree traversals; advanced hierarchical structures: n-ary trees, heaps, balanced trees, tries; priority queues; hashing; graphs, graph algorithms; memory management; applications.
Credits
3
Offered
Every semester