Contents

Indexes:

two-child-node |
---|

red-black-node |
---|

element | Reader:element. |
---|---|

left-child | Accessors:left-child. |

parent | Initargs::parent; Accessors:parent. |

right-child | Accessors:right-child. |

tree | Initargs::tree; Accessors:tree. |

bst-node-is-left-child | Is this node the left child of its parent? |
---|---|

bst-node-is-right-child | Is this node the right child of its parent? |

bst-node-replace-child | Replace the child of this node. |

bst-node-set-left-child | Set new-left as the left child of node |

bst-node-set-right-child | Set new-right as the right child of node |

delete-item | |

delete-node | |

find-item | Find item in container using the container's test |

find-successor-item | |

first-element | |

first-node | |

insert-item | Adds item to the container |

last-element | |

last-node | |

node-empty-p | |

predecessor | Return the item that comes |

right-most-child | Walk down the right side of the tree until a leaf node is |

setffirst-element | |

setflast-element | |

size | Returns the number of items currently in the container. |

splay-tree-rotate | rotate the node (and maybe the parent) until the node is |

splay-tree-splay | Preform the splay operation on the tree about this node |

successor | Return the item that comes after item in the container. Only makes sense for sorted containers. R... |

walk-tree | |

walk-tree-nodes |