Lines Matching defs:tree
15 SplayTree: A top-down splay tree.
60 Insert into the tree.
123 Remove from the tree.
149 Find the smallest item in the tree.
167 Find the largest item in the tree.
185 Find an item in the tree.
203 Test if the tree is logically empty.
269 If key is in the tree, then the node containing
270 that key becomes the root. If key is not in the tree,
272 < key in the tree, or the least key > key in the tree.
275 a key that's larger than any in the tree, the rightmost
276 node of the tree becomes the root. This property is used
372 Iterator(Tree* tree)
374 fTree(tree)
379 Iterator(Tree* tree, Node* next)
381 fTree(tree),
446 ConstIterator(const Tree* tree)
448 fTree(tree)
453 ConstIterator(const Tree* tree, Node* next)
455 fTree(tree),
558 Test if the tree is logically empty.