A binary search tree (BST), which may sometimes also be named a sorted or ordered binary tree, is an edge based binary tree data structure which has the following functionalities:

• The left subtree of a node acquires only nodes with keys less than the node's key.
• The right subtree of a node acquires only nodes with keys bigger than or equal to the node's key.
• Both the right and left subtrees must also be binary search trees.
• Usually, the information presented by each node is a record rather than a single data component. However, for sequencing purposes, nodes are differentiating according to their keys rather than any phase of their associated records.
• The major benefit of binary search trees over other data structures is that the search algorithms and related sorting algorithms such as in-order traversal can be very useful.

 

Posted Date: 7/27/2012 6:32:35 AM | Location : United States

Ask an Expert

Related Discussions:- Binary search tree, Assignment Help, Ask Question on Binary search tree, Get Answer, Expert's Help, Binary search tree Discussions

Write discussion on Binary search tree
Your posts are moderated

Write your message here..

Related Questions

Representation of records, Records are mapped onto a computer store by simp... Records are mapped onto a computer store by simply juxtaposing their elements. The address of a component (field) r relative to the origin address of the record r is named the fiel

Tree traversals, There are three kinds of tree traversals, namely, Postorde... There are three kinds of tree traversals, namely, Postorder , Preorder and Inorder. Preorder traversal: Each of nodes is visited before its children are visited; first the roo

Explain how the shuttle sort algorithm works, Question 1 Explain how th... Question 1 Explain how the shuttle sort algorithm works by making use of the following list of integers:11, 4, 2, 8, 5, 33, 7, 3, 1, 6. Show all the steps. Question 2

Sorting, Define Hashing. Store the following values in a hash table of tabl... Define Hashing. Store the following values in a hash table of table size 11 using division method: 25, 42, 96, 101, 102, 162, and 197. In case of collision, use other hash functio

Polynomials - represented by using arrays, /* the program accepts two polyn... /* the program accepts two polynomials as a input & prints the resultant polynomial because of the addition of input polynomials*/ #include void main() { int poly1[6][

Explain space complexity, Explain Space Complexity Space Complexity :... Explain Space Complexity Space Complexity :- The space complexity of an algorithm is the amount of memory it requires to run to completion. Some of the reasons to study space

Algorithm to add element in the end of circular linked list, Q. Write down ... Q. Write down an algorithm to add an element in the end of the circular linked list.        A n s . Algo rithm to Add the Element at the End of Circular Linked Lists

How do collisions happen during hashing, How do collisions happen during ha... How do collisions happen during hashing? Usually the key space is much larger than the address space, thus, many keys are mapped to the same address. Assume that two keys K1 an

Complexity, Complexity : How do the resource needs of a program or algorith... Complexity : How do the resource needs of a program or algorithm scale (the growth of resource requirements as a function of input). In other words, what happens with the performan

Complexity of an algorithm, What do you mean by complexity of an algorithm?... What do you mean by complexity of an algorithm? The complexity of an algorithm M is the function f(n) which gives the running time and/or storage space need of the algorithm i