for pointers - for vectors newline characters - next fit algorithm - nievergeltj nishimurat node class for lists - nodes binary search trees - binomial trees decision trees expression trees leftist heaps - - linked lists - lists - pairing heaps red-black trees skew heaps - splay trees treaps trees - nondeterministic algorithms nondeterminism nonpreemptive scheduling nonprintable characters nonterminating recursive functions np-completeness easy vs hard - np class references for traveling salesman problem, - null paths in leftist heaps - nullptr null-terminator characters numcols function numrows function object type objects declaring dynamic - function - passing - odlyzkoa off-line algorithms approximate bin packing - disjoint sets ofmany ohlebushe on-line algorithms approximate bin packing - definition disjoint sets one-dimensional circle packing problem one-parameter set operations - onecharoff function - operands in expression trees operators in expression trees - operator!function hash tables - lists - operator(function - operatorfunction lists - matrices - operator+function - operatorfunction in comparable type in square - sets operator<function - operatorfunction - binary search trees - binomial queues in employee iterators leftist heaps lists - red-black trees top-down splay trees vectors - operator=function hash tables - lists - operator[function lists maps - matrices - vectors overloading optimal binary search trees - optmatrix function order binary heaps - matrix multiplications - orlinj 'rourkej orthogonal range queries othello game ottmant overflow in -trees in hash function stack - overloading operators - - overmarsm paghr pair class for maps for sets pairing heaps - panv papadakist papadimitriouc papernova paragraphsright-justifying - parameters default - passing - template parentheses [)balancing - for postfix conversions - parents in trees - parkk parks parse trees partial find partial match queries partialsum function -