Results 1 to 2 of 2
  1. #1
    CeciliaP is offline Member
    Join Date
    Mar 2012
    Posts
    3
    Rep Power
    0

    Default Binary Search Trees - Weighting and Recursion

    Hi - I have to create an integer based BST and then weight it, balance it and then print every node and it's parent. I am having to implement a queue and use recursion and I'm so confused. Any help would be appreciated.

  2. #2
    JosAH's Avatar
    JosAH is offline Moderator
    Join Date
    Sep 2008
    Location
    Voorschoten, the Netherlands
    Posts
    13,529
    Blog Entries
    7
    Rep Power
    20

    Default Re: Binary Search Trees - Weighting and Recursion

    Quote Originally Posted by CeciliaP View Post
    Hi - I have to create an integer based BST and then weight it, balance it and then print every node and it's parent. I am having to implement a queue and use recursion and I'm so confused. Any help would be appreciated.
    Google for 'AVL trees', they're one of the first balanced trees, or 'Red Black trees'; they're 'less balanced' but easier to implement.

    kind regards,

    Jos
    cenosillicaphobia: the fear for an empty beer glass

Similar Threads

  1. Replies: 6
    Last Post: 10-21-2011, 03:59 AM
  2. Replies: 0
    Last Post: 10-20-2011, 06:22 PM
  3. Replies: 2
    Last Post: 10-19-2011, 11:35 PM
  4. implement binary search method using recursion?
    By chopo1980 in forum New To Java
    Replies: 1
    Last Post: 12-12-2009, 03:58 PM
  5. Tutorial on Binary Search Trees
    By JordashTalon in forum New To Java
    Replies: 3
    Last Post: 03-18-2009, 03:51 PM

Posting Permissions

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