Chapter 14 — Node-Based Data Structures

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/14

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 3:06 PM on 8/28/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

15 Terms

1
New cards
Node
A unit that stores data and a link to another node
2
New cards
Linked list
A chain of nodes where each node points to the next node
3
New cards
Head
The first node in a linked list
4
New cards
Tail
The last node in a linked list
5
New cards
next_node
The link from one node to the next
6
New cards
Null link
Shows the list has ended
7
New cards
Linked list read
O(N), because links must be followed from the head
8
New cards
Linked list search
O(N)
9
New cards
Insert at beginning linked list
O(1), because only the head link changes
10
New cards
Delete at beginning linked list
O(1), because the head moves to the next node
11
New cards
Insert/delete at index linked list
O(N), because you must first walk to the position
12
New cards
Array vs linked list read
Array is O(1); linked list is O(N)
13
New cards
Array vs linked list beginning insert/delete
Linked list is faster because arrays shift values
14
New cards
Doubly linked list
Each node points to next and previous nodes
15
New cards
Queue with doubly linked list
Can enqueue at end and dequeue from front efficientl