Explain binary search tree, Data Structure & Algorithms

Binary search tree.

A binary search tree is a binary tree that is either empty or in which every node having a key that satisfies the following conditions: -

All keys (if any) in the left sub tree of the root precede the key in the root.

The key in the root precedes all keys (if any) in its right sub tree.

The left and right sub trees of the root are again search trees.

 

Posted Date: 5/11/2013 1:10:01 AM | Location : United States







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

Write discussion on Explain binary search tree
Your posts are moderated
Related Questions
Illustrate the intervals in mathematics Carrier set of a Range of T is the set of all sets of values v ∈ T such that for some start value s ∈ T and end value e ∈ T, either s ≤

What is quick sort? Quick sort is a sorting algorithm that uses the idea if split and conquer. This algorithm chooses an element called as pivot element; search its position in

Question 1. Explain the different types of traversal on binary tree 2. Explain the Prim's minimum spanning tree algorithm 3. Differentiate fixed and variable storage allo

write an algorithm for multiplication of two sparse matrices using Linked Lists

Q. How can we free the memory by using Boundary tag method in the context of Dynamic memory management?

Merge sort is a sorting algorithm which uses the basic idea of divide and conquers. This algorithm initially divides the array into two halves, sorts them separately and then merge

Explain in detail about the Ruby arrays Ruby arrays have many interesting and powerful methods. Besides indexing operations which go well beyond those discussed above, arrays h

Write the algorithm for compound interest

State the ways to construct container taxonomy There are several ways that we could construct our container taxonomy from here; one way that works well is to make a fundamental

For AVL trees the deletion algorithm is a little more complicated as there are various extra steps involved in the deletion of node. If the node is not a leaf node, then it contain