Results 1 to 3 of 3
  1. #1
    Alex_25 is offline Member
    Join Date
    Oct 2011
    Posts
    6
    Rep Power
    0

    Exclamation Java course evaluation assignment about binary search trees

    I have a course evaluation assignment about binary search trees and idk how to do it?
    That assignment is a combination of red-black trees and binary search trees in general and is until sunday at midnight,if anyone can help me somehow with the implementation and test or give me some hints how to do something, at least some simple program.
    Here it is what it says:
    Your solution of this assignment must be handed in before Sunday 23-Oct-
    2011 at 23:59. It will be a part of the evaluation of the course. If you fail
    this assignment you will fail the course.
    The assignment is individual. Similar solutions from different persons will not
    be accepted.
    In this assignment you have to design and implement a “Hit Balanced Tree”
    (HBT). HBT is a new data structure invented for this assignment and it might
    not be of any use in real programs.
    An HBT is an ordinary binary search tree where all the nodes contain an
    extra attribute – number of hits. When a node is created the hit count is set
    to zero. Every time the node is found with the find(), contains() etc.
    methods its hit count is incremented by one.
    When an HBT is balanced, all the descendants of a node have lower hit count
    than the node itself. On the other hand, it is still a search tree, where all
    nodes in the left subtree of node have elements smaller than the element of
    the node, and corresponding greater than for the right subtree.
    In other words: the root will be the node with the highest hit count. To the
    left are the smaller elements and the larger element are to the right. This
    rule is applied recursively down both the subtrees.
    Implement an HBT and make a proper test of your implementation.

    pls i need some help, i would be really gratefull :D :D if it's possible something simple without generics and exceptions, HEEEEELP

  2. #2
    doWhile is online now Moderator
    Join Date
    Jul 2010
    Location
    California
    Posts
    1,642
    Rep Power
    7

    Default Re: Java course evaluation assignment about binary search trees


  3. #3
    Alex_25 is offline Member
    Join Date
    Oct 2011
    Posts
    6
    Rep Power
    0

    Default Re: Java course evaluation assignment about binary search trees

    will i find answer if i leave the question as it it now??

Similar Threads

  1. HELP!! Binary trees
    By Get_tanked in forum New To Java
    Replies: 4
    Last Post: 03-24-2011, 06:09 PM
  2. Binary trees
    By girgishf in forum Advanced Java
    Replies: 15
    Last Post: 11-20-2010, 04:29 PM
  3. Tutorial on Binary Search Trees
    By JordashTalon in forum New To Java
    Replies: 3
    Last Post: 03-18-2009, 03:51 PM
  4. java binary search and insert
    By pansylea in forum New To Java
    Replies: 6
    Last Post: 02-23-2009, 04:54 PM
  5. Binary Search in Java
    By Java Tip in forum Algorithms
    Replies: 0
    Last Post: 04-15-2008, 07:43 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
  •