diff options
| author | Fuwn <[email protected]> | 2024-04-07 23:18:32 -0700 |
|---|---|---|
| committer | Fuwn <[email protected]> | 2024-04-07 23:18:32 -0700 |
| commit | c1b6ffe70bd281c6c230fd63fabcaac2aff47514 (patch) | |
| tree | e8af3b1782a7cd0754590ed618fddc1bdb9b7385 /chapter10/bintree.template | |
| download | dscode-main.tar.xz dscode-main.zip | |
Diffstat (limited to 'chapter10/bintree.template')
| -rw-r--r-- | chapter10/bintree.template | 100 |
1 files changed, 100 insertions, 0 deletions
diff --git a/chapter10/bintree.template b/chapter10/bintree.template new file mode 100644 index 0000000..815aea5 --- /dev/null +++ b/chapter10/bintree.template @@ -0,0 +1,100 @@ +// FILE: bintree.template
+// IMPLEMENTS: The binary_tree node class (see bintree.h for documentation).
+#include <cassert> // Provides assert
+#include <cstdlib> // Provides NULL, std::size_t
+#include <iomanip> // Provides std::setw
+#include <iostream> // Provides std::cout
+
+namespace main_savitch_10
+{
+ template <class Process, class BTNode>
+ void inorder(Process f, BTNode* node_ptr)
+ // Library facilities used: cstdlib
+ {
+ if (node_ptr != NULL)
+ {
+ inorder(f, node_ptr->left( ));
+ f( node_ptr->data( ) );
+ inorder(f, node_ptr->right( ));
+ }
+ }
+
+ template <class Process, class BTNode>
+ void postorder(Process f, BTNode* node_ptr)
+ // Library facilities used: cstdlib
+ {
+ if (node_ptr != NULL)
+ {
+ postorder(f, node_ptr->left( ));
+ postorder(f, node_ptr->right( ));
+ f(node_ptr->data( ));
+ }
+ }
+
+ template <class Process, class BTNode>
+ void preorder(Process f, BTNode* node_ptr)
+ // Library facilities used: cstdlib
+ {
+ if (node_ptr != NULL)
+ {
+ f( node_ptr->data( ) );
+ preorder(f, node_ptr->left( ));
+ preorder(f, node_ptr->right( ));
+ }
+ }
+
+ template <class Item, class SizeType>
+ void print(binary_tree_node<Item>* node_ptr, SizeType depth)
+ // Library facilities used: iomanip, iostream, stdlib
+ {
+ if (node_ptr != NULL)
+ {
+ print(node_ptr->right( ), depth+1);
+ std::cout << std::setw(4*depth) << ""; // Indent 4*depth spaces.
+ std::cout << node_ptr->data( ) << std::endl;
+ print(node_ptr->left( ), depth+1);
+ }
+ }
+
+ template <class Item>
+ void tree_clear(binary_tree_node<Item>*& root_ptr)
+ // Library facilities used: cstdlib
+ {
+ if (root_ptr != NULL)
+ {
+ tree_clear( root_ptr->left( ) );
+ tree_clear( root_ptr->right( ) );
+ delete root_ptr;
+ root_ptr = NULL;
+ }
+ }
+
+ template <class Item>
+ binary_tree_node<Item>* tree_copy(const binary_tree_node<Item>* root_ptr)
+ // Library facilities used: cstdlib
+ {
+ binary_tree_node<Item> *l_ptr;
+ binary_tree_node<Item> *r_ptr;
+
+ if (root_ptr == NULL)
+ return NULL;
+ else
+ {
+ l_ptr = tree_copy( root_ptr->left( ) );
+ r_ptr = tree_copy( root_ptr->right( ) );
+ return
+ new binary_tree_node<Item>( root_ptr->data( ), l_ptr, r_ptr);
+ }
+ }
+
+ template <class Item>
+ size_t tree_size(const binary_tree_node<Item>* node_ptr)
+ // Library facilities used: cstdlib
+ {
+ if (node_ptr == NULL)
+ return 0;
+ else
+ return
+ 1 + tree_size(node_ptr->left( )) + tree_size(node_ptr->right( ));
+ }
+}
|