====== Chapter 15 ====== What are the advantages of using linked lists? What is the initial position of a list iterator? After inserting a new element, this element will be before or after the list iterator? Write the code to visit all elements of a linked list in two manners Compare the complexity of adding, remove, and research elements in an array and in linked list Write the code to add and remove the first element of the linked list Write the code to add and remove an element in the list iterator position What is the difference between a stack and a queue? ====== Chapter 16 ====== What are the characteristics of a Set? When we prefer using TreeSet instead of HashSet? What is the advantage of Sets comparing with Arrays and LinkedLists? Compare between Sets and Maps Give examples of hash functions What is a bucket in a hash table? How to find an element in a Hash Table? What is the complexity of adding, locating, and removing elements in a hash table?
How to choose the hash table size? Write to code add and remove an element from a HashSet What does method has Next() of HashSetIterator return? How to calculate the hash code of integer and strings? What is the characteristics of a binary Search Tree? How to create a binary search tree? How to delete an element from a binary search tree? Write the code to add a node in a binary search tree What is the complexity to add a new element in a binary search tree? Compare between balanced and unbalanced tree What is the difference between the different tree traversal schemes? When using the postorder traversal? What is the data structure using to implement the priority queue? What is the characteristics of a Heap? How to add and remove elements from a Heap? What is the Heap efficiency? Compare between the heapsort algorithm and the mergesort algorithm