binary search tree

A binary search tree is a binary treeMathworldPlanetmath where every node’s left subtree has keys less than the node’s key, and every right subtree has keys greater than the node’s key.

Title binary search tree
Canonical name BinarySearchTree
Date of creation 2013-03-22 17:21:59
Last modified on 2013-03-22 17:21:59
Owner Mathprof (13753)
Last modified by Mathprof (13753)
Numerical id 6
Author Mathprof (13753)
Entry type Definition
Classification msc 68P10
Classification msc 68P05