A special case of these allowing for easier insertions and deletions introduce "up-in" and "up-out" requests and is known as the relaxed type of them.  All 3-nodes have a certain restriction in the "Left Leaning" type of these data structures, which 
A special case of these allowing for easier insertions and deletions introduce "up-in" and "up-out" requests and is known as the relaxed type of them.  All 3-nodes have a certain restriction in the "Left Leaning" type of these data structures, which maintain a one-to-one correspondence with a 2-3-4 tree.  Deletion of nodes in these objects can be performed in a maximum of three rotations, and all of their leaf nodes contain no information.  In these data structures, a simple path from one node to all of its descendants must contain the same number of nodes that share a property with the root of the tree.  Like an AVL Tree, it provides a practical runtime of Big O of log n time for insertions, deletions and searches.  For 10 points, identify this type of self-balancing binary search tree, where every node is one of the two namesake colors.
A special case of these allowing for easier insertions and deletions introduce "up-in" and "up-out" requests and is known as the relaxed type of them.  
{Red-Black} Trees [prompt on self-balancing binary search {tree}]