Binary Search Tree


Gleicher Autor

Ähnlich

Binary Search Tree

Von: bart

n computer science, a binary search tree (BST) or ordered binary tree is a node-based binary tree data structure which has the following properties:b * The left subtree of a node contains only nodes with keys less than the node's key. * The right subtree of a node contains only nodes with keys greater than the node's key. * Both the left and right subtrees must also be binary search trees.

Publiziert am:: 14-10-2010