/* Sequential list data type implemented by a binary tree.
- Copyright (C) 2006 Free Software Foundation, Inc.
+ Copyright (C) 2006, 2009-2013 Free Software Foundation, Inc.
Written by Bruno Haible <bruno@clisp.org>, 2006.
This program is free software: you can redistribute it and/or modify
Let's call this the "black-height" bh of the tree. It follows that every
such path contains exactly bh black and between 0 and bh red nodes. (The
extreme cases are a path containing only black nodes, and a path colored
- alternatingly black-red-black-red-...-black-red.) The height of the tree
+ alternately black-red-black-red-...-black-red.) The height of the tree
therefore is >= bh, <= 2*bh.
*/
struct gl_list_node_impl *parent;
color_t color; /* node's color */
size_t branch_size; /* number of nodes in this branch,
- = branchsize(left)+branchsize(right)+1 */
+ = branchsize(left)+branchsize(right)+1 */
const void *value;
};