Noun
search tree (plural search trees) (computing theory) A tree (data structure) set up to facilitate searching. The red-black tree is a balanced binary search tree that has quite fast insert and delete operations and is always sorted.