#1  
24th March 2022, 10:38 PM
Unregistered
Guest
 
Posts: n/a

Write an efficient program to test whether a given tree is Binary search Tree or not


You have a tree and address of its root. Write an efficient program to test whether a given tree is Binary search Tree or not. (Hint: In-order traversal of binary search tree is sorted in increasing order. Use this property to develop program)




Do you have any question? or have anything to say?





Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2024, Jelsoft Enterprises Ltd.
Search Engine Optimization by vBSEO 3.3.0
vBulletin Optimisation by vB Optimise.
Please also check: