a binary tree where every node has a value, every node 's left subtree has values less than the node's value, and every right subtree has values greater

a binary tree where for each node v , the item stored at v is greater than or equal to the item stored at the left child (if any) of v , and is less than or equal to the the item stored at the right child (if any) of v

a binary tree whose left subtree contains values less than itself, and whose right subtree contains values greater than itself

a binary tree with more constraints

a collection that is made up of a set of nodes

a tree in which each node stores a key/value pair

a usual binary tree with each of its nodes being able to have two children, a left and a right child

a data structure with in which every node refers to a left subtree and a right subtree such that all values in the left subtree are smaller than the value in the node and all elements in the right subtree are greater than (or equal to) the value in the node. the top node is called the root. the nodes with no children (left and right subtrees empty) are called leaves.

binary tree (see binary tree) with the additional property that the key in each node's left child is less than the node's key, and that the key in each node's right child is greater than the node's key. In inorder traversal (see inorder traversal), the items in a BST are visited in sorted order of their keys.

A search structure in which, at each step of the search, the set of data elements is divided by two; some appropriate action is taken in the case of an odd number of data elements.