Lines Matching full:splay
43 * splay trees and red-black trees.
45 * A splay tree is a self-organizing data structure. Every operation
46 * on the tree causes a splay to happen. The splay moves the requested
55 * amortized cost for a sequence of m accesses to a splay tree is O(lg n);
164 /* Main splay operation.
248 /* Splay with either the minimum or the maximum element \
