Binary Search Trees
| Experience & Outcome | I am developing my understanding of information and can use an information model to describe particular aspects of a real world system TCH 3-13b |
| Learning Outcome | – I can assess the efficiency of a binary search tree (BST) for searching. – I can compare the efficiency of a binary search tree (BST) with other approaches to searching – I can organise and find data using a binary search tree (BST) |
| Computer Science Concepts | Algorithms |
| Computational Thinking Concepts & Approaches | Evaluation, Algorithmic thinking, Decomposition |
| Lesson Overview | Pupils will create binary search trees either outside using chalk or indoors in a large space using masking tape and post its. |
| Lesson plan | You will find the full lesson plan here. |
Edinburgh Learns Digital | City of Edinburgh Council 