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!:confused:
is this what you are after?