+ Reply to Thread
Results 1 to 2 of 2

Thread: Write a program to check whether a tree is BST or not

  1. 20th July 2010, 12:54 #1
    Surfer
    Surfer is offline Senior Member
    Join Date
    Mar 2010
    Posts
    321

    Write a program to check whether a tree is BST or not

    Write a program to check whether a tree is BST or not
    Digg this Post!Add Post to del.icio.usBookmark Post in TechnoratiFurl this Post!
    Reply With Quote Reply With Quote
  2. 13th February 2012, 17:48 #2
    nitingupta180
    nitingupta180 is offline Junior Member
    Join Date
    Feb 2012
    Posts
    1
    Do the inorder traversal of the tree. and store the node values in array. If the array is sorted then it is BST \m/
    Digg this Post!Add Post to del.icio.usBookmark Post in TechnoratiFurl this Post!
    Reply With Quote Reply With Quote
+ Reply to Thread
« Maximum number of binary tree using 3 nodes

Thread Information

Users Browsing this Thread

There are currently 1 users browsing this thread. (0 members and 1 guests)

Similar Threads

  1. Write output of given program
    By TopGun in forum Microsoft
    Replies: 3
    Last Post: 13th June 2011, 22:27
  2. Write a program to replace all spaces in a string with %20
    By Surfer in forum Amazon
    Replies: 1
    Last Post: 19th July 2010, 22:31
  3. Draw Expression Tree and Write Postfix equivalent
    By TopGun in forum Adobe
    Replies: 0
    Last Post: 18th July 2008, 12:28

Tags for this Thread

Bookmarks

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts

Forum Rules