tpl_hRbTree.H File Reference

Hybrid top-down/bottom-up red-black tree implementation. More...

#include <tpl_binNode.H>
#include <tpl_binNodeUtils.H>
#include <tpl_arrayStack.H>
#include <rbNode.H>

Include dependency graph for tpl_hRbTree.H:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	Aleph::HtdRbTree< Key, Compare >
	Hybrid top-down/bottom-up red-black tree. More...
struct	Aleph::HtdRbTree< Key, Compare >::Iterator
	In-order iterator. More...
class	Aleph::HtdRbTreeVtl< Key, Compare >
	Hybrid red-black tree with virtual node destructor. More...

Namespaces
namespace	Aleph
	Main namespace for Aleph-w library functions.

Detailed Description

Hybrid top-down/bottom-up red-black tree implementation.

This file implements a red-black tree that uses:

• Top-down insertion with proactive color flipping (like Sedgewick's approach)
• Bottom-up deletion with stack-based ancestor tracking

This hybrid approach combines the benefits of both strategies:

• Single-pass insertion (no backtracking)
• Efficient deletion with stack for ancestor access

Definition in file tpl_hRbTree.H.