|
Data Structures & Algorithms in C++
Goodrich, Tamassia, Mount and Goldwasser
|
#include <iostream>#include <string>#include <vector>
Namespaces | |
| namespace | dsac |
| Code from the zyBook "Data Structures and Algorithms in C++" by Goodrich/Tamassia/Mount/Goldwasser. | |
| namespace | dsac::tree |
| Code from the chapter "Trees". | |
Functions | |
| template<typename Position > | |
| void | dsac::tree::print_preorder_indent (Position p, int d=0) |
| Prints preorder representation of subtree rooted at p having depth d. | |
| template<typename Position > | |
| void | dsac::tree::print_preorder_labeled (Position p, std::vector< int > &path) |
| Prints labeled representation of subtree rooted at p having depth d. | |
| template<typename Position > | |
| void | dsac::tree::parenthesize (Position p) |
| Prints parenthesized representation of subtree rooted at p. | |
| template<typename Position > | |
| int | dsac::tree::disk_space (Position p) |
| Returns total disk space of elements stored in subtree rooted at p. | |
| template<typename Position > | |
| int | dsac::tree::layout (Position p, int d, int x) |