General description
The Data Structures and Algorithms (2) course, which is an extension of the Data Structures and Algorithms (1) course, deals with complements in binary trees, data (graphs), and some new sorting and searching algorithms. It also deals with non-binary tree data structures such as B-Trees, B + Trees, Red- Black Trees and operations on. In the Algorithms axis, it will be discussion about Greedy Algorithms and dynamic programming.