Thread: Red-Black Tree rules

  1. #1
    Registered User
    Join Date
    Sep 2001

    Question Red-Black Tree rules

    I am trying to construct a red and black tree with the rules.
    The tree must be built in accordance with BST and Red-Black tree rules.

    1. enter data
    2. test and reblance the tree as each number is entered.
    3. search the tree for any number
    4. How many level down in the tree
    5. premit the user to delete from tree

    Have anyone program this before, I know a little about BST but red-black tree is strange to me. where can I get more guidiance. I went to a few web sites but can not understand the process.

    any help is appreciated!

  2. #2
    Skunkmeister Stoned_Coder's Avatar
    Join Date
    Aug 2001
    is this what you are after?
    Free the weed!! Class B to class C is not good enough!!
    And the FAQ is here :-

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Interpreter.c
    By moussa in forum C Programming
    Replies: 4
    Last Post: 05-28-2008, 05:59 PM
  2. Binary Search Trees Part III
    By Prelude in forum A Brief History of
    Replies: 16
    Last Post: 10-02-2004, 03:00 PM
  3. Request for comments
    By Prelude in forum A Brief History of
    Replies: 15
    Last Post: 01-02-2004, 10:33 AM
  4. I need some ideas please>>
    By Unregistered in forum C Programming
    Replies: 3
    Last Post: 08-23-2002, 01:55 PM
  5. BST/Red and Black Tree
    By ghettoman in forum C++ Programming
    Replies: 0
    Last Post: 10-24-2001, 10:45 PM