What is a binary search tree (BST)?

What is a binary search tree (BST)?

Approach: Define node ordering property.

A node-based binary tree where the left subtree of a node contains only nodes with keys lesser than the node's key, and the right subtree contains only nodes with keys greater.

Follow-up: What is the worst-case search time in a BST?

Key concepts: left child, right child, ordering.