1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.

Binary Search Tree

Discussion in 'C' started by rakesh.soni, Sep 13, 2007.

  1. rakesh.soni

    rakesh.soni New Member

    Joined:
    Sep 13, 2007
    Messages:
    1
    Likes Received:
    0
    Trophy Points:
    0
    Location:
    Hyderabad, India
    Is anybody has solution for this problem in C

    Given a sequence of lowercase alphabetic strings, insert them in a binary search tree. Output the inorder, preorder and postorder traversals of the tree. The output should be in uppercase.
     
  2. DaWei

    DaWei New Member

    Joined:
    Dec 6, 2006
    Messages:
    835
    Likes Received:
    5
    Trophy Points:
    0
    Occupation:
    Semi-retired EE
    Location:
    Texan now in Central NY
    Home Page:
    Yes, I can do that, but this is your task, right? Study binary search trees. You can build them either with arrays or with linked nodes. Post troublesome code here for help. Be sure and read the "Before you make a query" thread so you know how to post your code in code tags.
     

Share This Page