Trees (OCR A-Level Computer Science): Quizzes

A hierarchical data structure of nodes

The topmost node

A node with no children

A connection between parent and child

At most two

Left child

Nodes can have more than two children

$O(\log n)$

$2i + 1$

$2i + 2$

Left → Right → Root

D → E → B → C → A

Level by level, left to right

Replace with in-order successor

$O(n)$