# C++ Programming Code Examples

## C++ > Data Structures and Algorithm Analysis in C++ Code Examples

Finding the smallest item in the tree. Return smallest item or 'INFINITY' if empty. Find the largest item in the tree. "Return the Largest" item or INFINITY if empty. Find item x in the

Test if the tree is logically empty. Return true if empty, false otherwise. Then print the tree contents in 'sorted order'. Internal method to print a subtree t in sorted order. And Internal

Internal method to insert into a subtree. x is the item to insert. t is the node that roots the tree. Set the "New Root". Internal method to remove from subtree. x: the item to remove.

"Change the Value" of the item stored in the pairing heap. Does nothing if newVal is larger than currently stored value. p points to node returned by insert. "newVal" is the new value

Process a request; return false if end of file. A simple main that reads a file given by argv[1] and then calls "processRequest" to compute shortest paths. Then 'Skimpy' error checking

Page 1 Page 2 Page 3