summary
To summarise what was learnt in class, we studied about linked list and its type, which is single and double, stack and queue concept, moreover we studied about hashing and how it is fast in order to retrieve data, and binary search tree, the summary is below. link to the coding assignment https://drive.google.com/open?id=1zQnFNFnsSo1HLUdupK6EomdaTY7KRMLW Linked list is a data structure that consist of a sequence of data records such that each record there is a field that contain a reference to the next record in the sequence 3 types :- - single - double - multiple in single list we can create a pointer that can point in one direction, a double linked list we can point to two direction, while a multiple linked list can point to more than two. code snippet for a double linked list. in a single linked list we only have one pointer for ex:- struct tnode *next; there is 2 methods of a linked list, insert and delete. in the code snippet we have insert, to insert ...