Red-Black tree in PROLOG 
Author Message
 Red-Black tree in PROLOG


Before in this forum, some people ask red-black tree's delete opertion.

and then, get reply for implementation in mercury library:

But I read the source, occur after RB-tree's delete operation which
it HAVE NOT rebalance the RB-tree(just common BST delete an element).

It destroy a condition of RD-tree
1. each search path from the root to a leaf consists of the same number of
black nodes.

Is it still is a Red-Black tree yet or not?

AND, the implementation is very much use -> (if-then-else) to do flow
condition, so
very difficult to read and destroy the elegant of logic language.


Sat, 30 Jul 2005 16:30:31 GMT  
 [ 1 post ] 

 Relevant Pages 

1. Red Black Tree in PROLOG

2. searching trees (AVL, 2-3-4 and red-black trees)

3. Red Black Tree - delete function

4. Program to create Red-Black Trees

5. AVL and red-black trees

6. need code for red-black binary search tree

7. red-black trees in fortran

8. Red - black trees

9. Red-Black-Trees and Fortran 2003 Features

10. Red-Black trees

11. Questions: Bushy trees in Prolog and C functions from/to Prolog

12. Need SWI-PROLOG 3.0.1 for Red Hat


Powered by phpBB® Forum Software