Given a Binary Tree, Programmatically you need to Prove it is a Binary Search Tree
Click for Solution

  • Warning: Illegal string offset 'name' in /home/prepdo6/gpl4you/discussquessub.php on line 681
    A do the inorder traversal of the tree,and store all the nodes in an array at the tym of traversal itself. then compare i(th) element with d (i+1)th element if for all 0<i<n a[i]<=a[i+1] the tree is a BST


    Smiley
[Insert Code]