Binary Trees and Binary Search Trees
Students will explore how 'if-then-else' statements allow programs to make decisions and respond to different conditions.
About This Topic
Students will explore how 'if-then-else' statements allow programs to make decisions and respond to different conditions.
Key Questions
- Analyse the worst-case time complexity of search, insertion, and deletion in a binary search tree, identify the degenerate input that triggers it, and explain why it is equivalent to linear search.
- Implement in-order, pre-order, and post-order traversals iteratively using a stack and compare the structural information each traversal exposes about the tree.
- Design an algorithm to verify whether a given binary tree satisfies the BST property in O(n) time and prove its correctness.
Active Learning Ideas
See all activities→Activities & Teaching Strategies
See all activities
More in Abstract Data Structures and Algorithms
Introduction to Computational Thinking
Students will be introduced to the core concepts of computational thinking: decomposition, pattern recognition, abstraction, and algorithms, as problem-solving tools.
8 methodologies
Linked Lists: Implementation and Complexity Analysis
Students will learn basic ways to organize data using simple lists and tables, understanding how this helps in managing information.
8 methodologies
Stacks and Queues: Implementations and Applications
Students will identify and create simple step-by-step instructions (algorithms) for everyday tasks, understanding the importance of order and precision.
8 methodologies
AVL Trees and Height-Balanced Structures
Students will learn about loops (e.g., 'repeat' or 'for' loops) to perform actions multiple times, making programs more efficient.
8 methodologies
Hash Tables and Collision Resolution Strategies
Students will understand how variables are used to store and retrieve different types of data (numbers, text) in a program.
8 methodologies
Heaps and Priority Queues
Students will learn to create and use simple functions to group related instructions, making programs more organized and easier to manage.
8 methodologies