Data Structure is an arrangement of data in a computer’s memory (or sometimes on a disk). Data structures include arrays, linked lists, stacks, binary trees, and hash tables, among others. Algorithms manipulate the data in these structures in various ways, such as searching for a particular data item and sorting the data.
This course treats structured problem solving, data abstraction, and the comparative analysis of algorithm as fundamental tools of program design.
Understand the recursion techniques.
Describe the binary tree traversal techniques.
Evaluate Binary tree traversal (Inorder)
Explain how can visit the B.T by using Preorder.
Explain how can visit the B.T by using Postorder.
Be familiar with advanced data structures such as:
balanced search trees,
Complete search tree.
Able to understand the AVL tree.
Explain the insert operation on AVL tree.
Discuss the deletion operation on AVL tree.
Describe the meaning of Red-Black tree.
Learn how can insert elements in red black tree.
Explain the meaning of Graphs.
Understand the types of graphs.
Learn how to traverse graphs.
Explain how dijkstra’s algorithm works.
Be familiar with several sorting algorithms including: