Test whether a binary tree is a binary search tree, Data Structure & Algorithms

Assignment Help:

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

Ans.

The algorithm to check 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:- Test whether a binary tree is a binary search tree

DAA, what do we use asymptotic notation in study of algorithm?Describe vari...

what do we use asymptotic notation in study of algorithm?Describe various asymptotic notation and give their significance.

Two sparce matrices multipilcation algorithm, Write an algorithm for multi...

Write an algorithm for multiplication of two sparse matrices using Linked Lists.

Example of telephone directory, A telephone directory having n = 10 records...

A telephone directory having n = 10 records and Name field as key. Let us assume that the names are stored in array 'm' i.e. m(0) to m(9) and the search has to be made for name "X"

File organization, Define File organization''s and it''s types

Define File organization''s and it''s types

General, whats the definition of ADT and data type?

whats the definition of ADT and data type?

Linked list implementation of a queue, The fundamental element of linked li...

The fundamental element of linked list is a "record" structure of at least two fields. The object which holds the data & refers to the next element into the list is called a node .

Decision tree, . Create a decision table that describes the movement of inv...

. Create a decision table that describes the movement of inventory

Define binary search technique, Binary search technique:- This techniq...

Binary search technique:- This technique is applied to an ordered list where elements are arranged either in ascending order or descending order. The array is separated into t

The smallest element of an array''s index, The smallest element of an array...

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

Stack, Explain the array and linked list implementation of stack

Explain the array and linked list implementation of stack

Write Your Message!

Name

Email id

Message

Verfication Code

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

Submit Assignment

User Account

All Pages