Trees Topic 5.1.7 / HL extension / 4 lessons
Key points
  • how trees operate logically (both binary and non-binary);
  • the terms parent, left-child, right-child, subtree, root and leaf for a binary tree;
  • the result of inorder, postorder and preorder tree traversal.
  • sketching binary trees after adding a new data item, adding one or more new nodes, and/or removing one or more nodes.
Vocabulary
Resources
Related topics
Starter

Tasks
-->