Binary Search Tree

Computer Science
Written By Sureen Heer

Overview

Link to Experience: Binary Search Tree

Topics: computer science, binary search tree, binary, algorithms

Grades: 9-12

Standards:

Duration to complete: 10-15 minutes

Learning outcome: Students will understand how binary search trees are organized. They will apply this knowledge to complete the challenge binary search tree.

In the Classroom

Pre-Experience (Things to Look Out For):

  • What does it mean for something to be binary?

  • What are some ways numbers can be organized?

  • What are algorithms in computer science?

Post-Experience (Things to Think About):

  • What are binary search trees useful for?

  • How many ways are there to make a binary search tree when you have N nodes?

  • Do the values of a binary search tree must be numbers?

  • If you want to get all the values of a binary search tree in an ascending/descending order, what would you do?

Experience Outline

Frame 1: Title

Frame 2: How nodes are organized in a binary search tree

Frame 3: Changing values in a binary search tree without breaking the rules

Frame 4: Growing a binary search tree by adding nodes

Frames 5-7: Challenges to check understanding

Frame 8: Things to Think About

Sureen Heer
Previous

Minor Triads
Next

Bitwise Operations