kirscha kishimotoa kitten puzzle kleinp knapsack problem knight' tour knuthd kop komlosj korshj kruskalj jr kruskal function - kruskal' algorithm - kuhnh kurtzs labels for class members ladnerr lajoiej laker lamarcaa landaug landise langstonm lapoutrej larmorel last infirst out (lifolists see stacks lawlere lazy binomial queues - lazy deletion avl trees binary search trees hash tables leftist heaps lists - lazy merging binomial queues - fibonacci heaps leaves in trees leec leed leeg leek leftchild function - - leftist heaps - cutting nodes in - merging with - path lengths in - references for skew heaps - leftistheap class - leftistnode structure lehmerd lelewerd lemkep lempela length in binary search trees graph paths tree paths lenstrah jr leongh level-order traversal lewist 'hopital' rule lim liangf lifo (last infirst outlists see stacks light nodes in skew heaps limits of function growth lins linear congruential generators - linear-expected-time selection algorithm - linear growth rate - linear probing - linear worst-case time in selection problem linked lists - circular priority queues skip lists - stacks lippmans list class - listall function lists adjacency arrays for - implementation of - linked see linked lists queues see queues skip - stacks see stacks in stl - vectors for see vectors load factor of hash tables local optimums log-squared growth rate logarithmic growth rate logarithmic running time for binary searches - for euclid' algorithm - for exponentiation - logarithmsformulas for - longest common prefix (lcp) - longest common subsequence problem longest increasing subsequence problem look-ahead factors in games loops graph in running time lower bounds - of function growth maximum and minimum - selection - for sorting - lup luekerg lvalue - - lvalue reference - -ary search trees mahajans main memorysorting in majority problem makeempty function for binary heaps for binary search trees - for binomial queues for hash tables for leftist heaps for lists for top-down splay trees