Whether a binary tree is a binary search tree or not, Data Structure & Algorithms

Assignment Help:

Write an algorithm to test whether a Binary Tree is a Binary Search Tree.

The algorithm to test whether a Binary tree is as Binary Search tree is as follows:

bstree(*tree)
{
while((tree->left !=null)&& (tree->right !=null))
{
if(tree->left < tree->root)
   bstree(tree->left);
else
   return(1);
if(tree->right > tree->root)
   bstree(tree->right);
else
return(1);
}
return(0);
}

Related Discussions:- Whether a binary tree is a binary search tree or not

Data type, Q. Define the terms data type and abstract data type. Comment up...

Q. Define the terms data type and abstract data type. Comment upon the significance of both these. Ans: We determine the total amount of memory to reserve by determining

Implementation of stack, Before programming a problem solution those employ...

Before programming a problem solution those employees a stack, we have to decide how to represent a stack by using the data structures which exist in our programming language. Stac

Explain the bubble sort algorithm, Explain the bubble sort algorithm. ...

Explain the bubble sort algorithm. Answer This algorithm is used for sorting a list. It makes use of a temporary variable for swapping. It compares two numbers at an insta

Bubble sort, Q. The reason bubble sort algorithm is inefficient is that it ...

Q. The reason bubble sort algorithm is inefficient is that it continues execution even after an array is sorted by performing unnecessary comparisons. Therefore, the number of comp

Rotations in binary tree, H o w can you r ot a t e a B i n a r y...

H o w can you r ot a t e a B i n a r y Tr e e? E x pl a i n r i g h t a n d l eft r ot a tion s by taking an e x a mpl e. If after

Linked list, how to creat atm project by using linked list?

how to creat atm project by using linked list?

Depth-first search (dfs) , In this respect depth-first search (DFS) is the...

In this respect depth-first search (DFS) is the exact reverse process: whenever it sends a new node, it immediately continues to extend from it. It sends back to previously explore

Doubly linked list having n nodes, The time required to delete a node x fro...

The time required to delete a node x from a doubly linked list having n nodes is O (1)

Array-based representation of a binary tree, Assume a complete binary tree ...

Assume a complete binary tree T with n nodes where each node has an item (value). Label the nodes of the complete binary tree T from top to bottom & from left to right 0, 1, ..., n

Search engines - applications of linear and binary search, Search engines e...

Search engines employ software robots to survey the Web & build their databases. Web documents retrieved & indexed through keywords. While you enter a query at search engine websit

5/11/2013 1:51:51 AM Thanks for suggesting me this answer, appreciate your knowledge.

5/11/2013 1:51:51 AM

Thanks for suggesting me this answer, appreciate your knowledge.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages