Dynamic Arrays and Linked Lists
0.0(0)
Studied by 0 people
Call Kai
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Knowt PlayCard Sorting
1/37
There's no tags or description
Looks like no tags are added yet.
Last updated 6:29 PM on 6/7/26
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
38 Terms
1
New cards
Array Strength
Sequential access (cache-friendly)
2
New cards
Array Weakness
Insertions and deletions are expensive because elements must be shifted
3
New cards
Array Weakness
Arrays have a fixed size and may need resizing
4
New cards
Array Access by Index complexity
O(1)
5
New cards
Array Search Unsorted complexity
O(n)
6
New cards
Array Append complexity
O(1)
7
New cards
Array Insert at Position complexity
O(n)
8
New cards
Array Remove complexity
O(n)
9
New cards
Dynamic Array Resize
Create larger array and copy all elements
10
New cards
List<T> Implementation
C# List<T> uses a dynamic array internally
11
New cards
Linked List Definition
Linear collection of nodes connected by references
12
New cards
Node Components
Value and Next reference
13
New cards
Head Definition
First node in a linked list
14
New cards
Linked List Search complexity
O(n)
15
New cards
Linked List Traverse (Display All) complexity
O(n)
16
New cards
Linked List Ordered Insert
Find position then insert node
17
New cards
Linked List Delete
Adjust references to skip deleted node
18
New cards
Array Access by Index complexity
O(1)
19
New cards
Linked List Access by Index complexity
O(n)
20
New cards
Array Search complexity
O(n)
21
New cards
Linked List Search complexity
O(n)
22
New cards
Array Insert complexity
O(n)
23
New cards
Linked List Insert complexity
O(1) once position is known
24
New cards
Array Remove complexity
O(n)
25
New cards
Linked List Remove complexity
O(1) once position is known
26
New cards
Linked List Insert Reality complexity
Finding the position is usually O(n)
27
New cards
Doubly Linked List Definition
Linked list where each node has Next and Previous references
28
New cards
Doubly Linked List Advantage
Can traverse forward and backward
29
New cards
Doubly Linked List Node
Value; Next; Previous
30
New cards
DLL AddFirst
Insert node at beginning
31
New cards
DLL AddLast
Insert node at end
32
New cards
DLL InsertAfter
Insert node after a given node
33
New cards
DLL AddSorted
Insert node while maintaining sorted order
34
New cards
DLL Delete
Reconnect previous and next nodes around deleted node
35
New cards
Singly Linked List Node
Value; Next
36
New cards
Doubly Linked List Node
Value; Next; Previous
37
New cards
Linked List Order
Maintained through references rather than contiguous memory
38
New cards
Array vs Linked List Main Difference
Arrays use contiguous memory while linked lists use references