Chapter 15 — Speeding Up All the Things with Binary Search Trees

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/16

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 3:07 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

17 Terms

1
New cards
Tree
A node-based structure where nodes can have child nodes
2
New cards
Root
The top node of a tree
3
New cards
Parent
A node with children below it
4
New cards
Child
A node below another node
5
New cards
Leaf
A node with no children
6
New cards
Binary tree
A tree where each node has up to two children
7
New cards
Binary search tree
A binary tree with smaller values left and larger values right
8
New cards
BST left rule
Values less than a node go left
9
New cards
BST right rule
Values greater than a node go right
10
New cards
BST search
Compare at root, then move left or right
11
New cards
Balanced BST search
O(log N)
12
New cards
Imbalanced BST search
O(N), if it acts like a linked list
13
New cards
BST insertion
Search for the correct empty spot and insert there
14
New cards
Delete leaf node
Remove it directly
15
New cards
Delete node with one child
Connect parent to the child
16
New cards
Delete node with two children
Replace with successor node
17
New cards
Successor node
Smallest value greater than the deleted nod