Search Tree Workshop

About this app

Insert, search and delete numbers in a binary search tree: the comparison path lights up node by node with the sentence from the slides (‘22 > 21: right’). Below, the pointer of a sorted linked list runs along, and two counters compare tree and list. Nodes stand in inorder sequence and only move sideways on insertion. 1 2 3 4 5 makes the tree degenerate into a list (depth 5 instead of 3). Plus the three deletion cases, an object view with node cards and the exercises max, depth and search tree by hand.

Subject: Computer science

More from Computer science

• Ackermann function
• Elevator simulator
• Binary workshop
• Binary versus linear search
• The Collatz problem
• Inside a CPU
• Swap the inside
• Function rooms in 3D

A VisuApp by heyprof: interactive, free in your browser, no sign-up. What is a VisuApp? · All apps