PlanetMath: binary search tree

(more info)

Math for the people, by the people.

donor list - find out how

Main Menu

binary search tree

(Definition)

A binary search tree is a binary tree 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.

"binary search tree" is owned by Mathprof.

(view preamble | get metadata)

Log in to rate this entry.
(view current ratings)

Cross-references: right subtree, keys, left subtree, node's, binary tree
There are 4 references to this entry.

This is version 3 of binary search tree, born on 2007-07-04, modified 2007-07-04.
Object id is 9727, canonical name is BinarySearchTree.
Accessed 1380 times total.

Classification:

AMS MSC:	68P05 (Computer science :: Theory of data :: Data structures)
	68P10 (Computer science :: Theory of data :: Searching and sorting)

Pending Errata and Addenda

None.[ View all 1 ]

Discussion

forum policy

No messages.

Interact