Binary Search Tree problem (too)

This is a discussion on Binary Search Tree problem (too) within the C Programming forums, part of the General Programming Boards category; << Split from http://cboard.cprogramming.com/c-pro...e-problem.html >> Hello. I have a problem with the project below. I started doing some things but ...

  1. #1
    Registered User
    Join Date
    Dec 2010
    Posts
    2

    Binary Search Tree problem (too)

    << Split from Binary Search Tree problem >>

    Hello. I have a problem with the project below. I started doing some things but because I'm not experienced at programming, I would like to help me to resolve to have it ready by Friday which I sumbit to the systems of my school. Sorry for my English but I am from Greece and the anxiety now affect.

    Information on each antenna connections stored in binary
    search trees (binary search trees) that will allow the introduction
    insertElement and deletion removeElement telephone {number, eventNo}. As
    considered key to the phone number. So for each node of the tree
    telephone numbers of the left sub-tree is smaller than the number
    phone hub and phone numbers of the right sub-tree
    older. No need to write code to keep the tree
    balanced. Information on each antenna connections stored in a table
    fragmentation. To use the key number. When
    more than one key corresponding to a position of hash table
    then the corresponding objects placed in a binary tree.

    If you need to make some extra things that will be right you have the ok from me...
    Please help! I'm desperate...
    Attached Files Attached Files

  2. #2
    Registered User
    Join Date
    Dec 2010
    Posts
    2
    I forgot to mention that the project consists of 3 phases. The one you sent was read aloud before the third. I've done some things in the first 2 phases on which i will send you to look.
    the first project was :The first delivery planned, a table stored
    information on the antennas of mobile communication system. Information
    for the neighbors as well as information on each antenna connections
    stored in the form of doubly linked lists.
    and the second project was: The second deliverable information for the connections of each antenna is stored in
    a hash table. For the key used phone number.
    When more than one key corresponding to a position in the table
    hash then the corresponding objects placed in a connected
    list.

    THANK YOU AGAIN!
    Attached Files Attached Files

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Binary Search Tree - object instantiation problem
    By patricio2626 in forum C++ Programming
    Replies: 3
    Last Post: 11-14-2006, 01:11 AM
  2. binary tree token problem
    By OldSchool in forum C++ Programming
    Replies: 13
    Last Post: 05-28-2006, 10:42 PM
  3. Binary Search Tree
    By penance in forum C Programming
    Replies: 4
    Last Post: 08-05-2005, 05:35 PM
  4. Binary Search Tree, Inserting node
    By cheryl_li in forum C Programming
    Replies: 1
    Last Post: 09-13-2003, 03:53 AM
  5. BST/Red and Black Tree
    By ghettoman in forum C++ Programming
    Replies: 0
    Last Post: 10-24-2001, 10:45 PM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21