TK Study

Software Engineering › Learn step by step › Y11 Programming Fundamentals

Item 99 of 426 · Year 11: Programming Fundamentals, 53 of 69

Tree

Term

Jump to a topic
  1. Exam format, question types and command words (46)
  2. Year 11: Programming Fundamentals (69)
  3. Year 11: The Object-Oriented Paradigm (33)
  4. Year 11: Programming Mechatronics (29)
  5. Year 12: Secure Software Architecture (57)
  6. Year 12: Programming for the Web (59)
  7. Year 12: Software Automation (35)
  8. Year 12: The Software Engineering Project (47)
  9. Diagrams and modelling tools (18)
  10. Python, SQL, pseudocode and CSS patterns (33)

See every item in the sequence

Definition

A hierarchical data structure of nodes: one root, each node having child nodes and leaves at the bottom (for example folder structures or decision trees).

Example: A file system is a tree.

Found in: syllabus, course specifications, sample exam and familiarisation guidelines, school notes, past SDD papers.

Where you'll use it in the test

Syllabus area: Y11 Programming Fundamentals.

Question types it can appear in

How to use it

A model sentence

General advice, built from the definition and example above

“A hierarchical data structure of nodes: one root, each node having child nodes and leaves at the bottom (for example folder structures or decision trees).” Then apply it: A file system is a tree.

In a short answer, give the definition in your own words first, then tie it to the situation in the question. Do not copy the example above unless it fits the scenario.

Go deeper

Check yourself

Explain “Tree” in one sentence, give an example, and name a question type that could test it.

Reveal the answer

A hierarchical data structure of nodes: one root, each node having child nodes and leaves at the bottom (for example folder structures or decision trees).

Example: A file system is a tree.

Could be tested as: Multiple choice, Fill in the blanks, Drawing.