## Syllabus

Binary trees will be examined at the level of diagrams and descriptions. Students are not expected to

construct tree algorithms using pseudocode.

Tracing and constructing algorithms are not expected.

5.1.14 Describe how trees operate logically

(both binary and non-binary).

2 LINK Recursive thinking.

5.1.15 Define the terms: parent, left-child,

right-child, subtree, root and leaf.

1 These definitions only apply to a

binary tree.

5.1.16 State the result of inorder, postorder

and preorder tree traversal.

1

5.1.17 Sketch binary trees. 3 Students should be able to sketch

diagrams showing the resulting

binary tree after adding a new data

item, adding one or more new nodes,

and/or removing one or more nodes.