B-Trees BSTs can either be bushy or spindly. A spindly BST tree is slow to access elements. Similar to a linked list. $O(N)$ time for accessing elements. A bushy BST is fast to ...

Extends When we use extends, we inherit all public members of a class into our child class. However, private attributes and methods are not inherited. Constructors are not inherited. However, ...

Disjoint Sets The disjoint set data structure is used to solve the “Dynamic Connectivity” problem The problem that we are working with is that we have various items. With a disjoint set, we ca...

Asymptotic Analysis Ex: Given a sorted array, determine if the array contains any duplicates. Silly approach: Check every element to each other, quadratic time. Better approach:...

Iterators, Object Methods We want to implement a Set called ArraySet Sets can only have one copy of each item. We start with an ArraySet with the following methods: ...

Subtype Polymorphism Vs Function Passing function passing is common in python, but Java code relies more on polymorphism. Polymorphism: The ability in programming to present the same programmi...

Asymptotic Analysis We want to be able to characterize the runtime of two algorithms using a mathematically rigorous method. One classification should be superior to another algorithm...

A motivation for inheritance When programming similar classes may have similar attributes and implementations, such as SLList, DLList, AList. When we try to implement a function to ta...

Inheritance It is not easy to micromanage separate methods that performs the same operation on multiple types of lists We may use method overloading, but it is aesthetically gross and won’t wo...

Doubly Linked Lists Data access is slow in DLList, it is proportional to the size of the array. An ArrayList is fast as array access is not depending on the size of the AList. ArrayLists ...