COMP 250 Lecture Notes - Lecture 6: Linked List, Dynamic Array

• School: McGill University
• Department: Computer Science (Sci)
• Course: COMP 250
• Professor: Claude Crepeau

Document Summary

Doubly linked lists have two linking sections in their respective nodes, one referring to the previous node in the list and the other referring to the next. Makes removal processes significantly shorter, taking place in constant time. Think of it as having a singly linked list in one direction, and another singly linked list in the other. To retrieve an element in a ll"s node: Getnode(i): if(i