01:198:112 Lecture Notes - Lecture 1: Linked List, Avl Tree, Binary Tree
1 Apr 2019
School
Department
Course
Professor
Document Summary
We already know one type of data structures, an array, 1d and 2d. Tuesdays and thursday 12pm-1pm at core 314, right next to hill center. Is continuous in memory, e. g. one items comes right after the other in memory location. Have to create a new array and copy elements of the previous one to the new one to make the array size bigger . You can access any element of an array very quickly, a big o(n) of constant, best property of an array. Gives flexibility of not having to worry about the size of the list, you can insert something and it will fit as long as the memory permits. These nodes have some sort of information stored in them and can link to another node, which may have a different piece of information to it. The use of nodes allow readjustments of links if a new item is added. Not continuous use of memory, it can be anywhere.
