Binary Search Tree
Main Concept
Binary Search Trees (BSTs) are rooted, ordered data structures that facilitate the efficient insertion, deletion and lookup of elements in large sets of data. Each element in a BST, called a node, may have up to two children, such that the left child is ordered less than or equal to and the right child greater than the parent node.
Each node may have two children. The left child is ordered less than or equal (duplicates are not supported in the current version) to and the right child greater than the parent node.
The height of a node is the number of nodes in the path to its deepest descendent. For e.g. the height of a node with no children is zero. The height of a tree is the height of its root node.
The depth of a node is the number of nodes between the root node and itself. For e.g. the left child of the root node has a depth of one.
A node with no children is called a leaf.
Explore by inserting, deleting and searching for elements in the binary search tree. Choose from the different tree-traversal methods. Notice that the Inorder traversal visits nodes in the ascending order of data values.
PreorderInorderPostorder
More MathApps
MathApps/ComputerScience
Download Help Document
