Trees and options

Содержание и основные понятия

Back to the table of contents
Alterna chapter 25
Trees and options
BST, bypasses, backtracking, N-Queens, Minimax for the 11th grade and EEG No.12.23.
The tree is a connected graph without cycles. It is built with a BST (prospecting O(log n)), a pile (heap sort), a file system, a hierarchy. Backtracking is the main way of cutting it off.
GEF · 11 grade
PIF · Baseline
EEG No. 12, 23
25
Chapter Pages
Five pages with theory, BST, N-Queens, and step-by-step animation of the minimax.
25.1
Trees and properties
BST, rounds, lots.
BST Designer
with step-by-step visualization and removal.
25.2
Review of options
Backtracking, reshuffling/depositioning/conclusion.
N-Queens Visualizer
Animation.
25.3
Game Tree
All-intelligible games.
Minimax step-by-step animation
and alpha-beta cut off with code illumination.
25.4
Workshop
Bank 16 assignments: 8 EEG + 8 EGE 12.23 with reviews.
25.5
Polygon examination
Quest 800 XP + test 10 min + open task with reference.
🔗
Links
Chapter 17/24
Counts: wood = private case.
Chapter 19
Game tree: Same idea.
Chapter 30
SDNF/Carta Carno: Data structures, too.