This unit introduces fundamental data structures, their implementation and use in efficient program solving in C++. Theory and implementation aspects are treated. Relations between the choice of structure and of algorithm are emphasised. Topics include: dynamic arrays, linked lists, stacks, queues, trees, graphs, hash tables, sorting and searching, recursive algorithms, and analysis of time complexity. COMP482 is based on COMP282 with additional load consisting of extra questions on an assignment and examination, and extra readings from the textbook- tree traversals, binary trees. COMP482 students are expected to show a greater level of understanding of the trees, binary trees and tree traversal.