Data Structure

What you’ll study

Internal data representation; abstract and elementary data types; elementary data structures; arrays — 1D and multidimensional; pointers and linked lists — single, double and circular linked lists; stack; queue — basic, circular and priority queue; recursion; graphs and graph traversal techniques; trees — n-ary tree, binary search tree, B-tree, B+ tree, B* tree and balanced tree; heap; reverse Polish notation and expression evaluation — in-order, pre-order and post-order; hashing and indexing techniques; sorting; searching; storage management. Reference languages: C/C++.