| S NO | Assessment statement | Grade | Teacher’s notes |
| 1 | Describe how trees operate logically (both binary and non-binary). | LINK Recursive thinking. | |
| 2 | Define the terms: parent, left-child, right-child, subtree, root and leaf. | These definitions only apply to a binary tree. | |
| 3 | State the result of inorder, postorder and preorder tree traversal. | ||
| 4 | Sketch binary trees. | 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. |
Previous page [1] | Next page [2]