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
Threaded Binary Tree:- By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using

Q. Explain that how do we implement two stacks in one array A[1..n] in such a way that neither the stack overflows unless the total number of elements in both stacks together is n.

The smallest element of an array's index is called its Lower bound.

Explain binary search with an example

You are given two jugs, a 4-gallon one and a 3-gallon one. Neither has any measuring marker on it. There is a tap that can be used to fill the jugs with water. How can you get exac

Q. Make a BST for the given sequence of numbers. 45,32,90,34,68,72,15,24,30,66,11,50,10 Traverse the BST formed in  Pre- order, Inorder and Postorder.

Question 1 Write a program in 'C' to read N numbers and print them in descending order Question 2 Discuss the properties of ADT Question 3 Write a note on

Define what an algorithm is and outline the characteristics of a good algorithm.

Explain Internal and External Nodes  To  draw  the  tree's  extension  by  changing  the  empty  subtrees  by  special nodes. The  extra  nodes shown by little squares are know

Q. Write  down a   programme  in  C  to  create  a  single  linked  list also  write the functions to do the following operations (i)  To insert a new node at the end (ii