Website Summary Files Commits Branches @commit @diff @stats
path: root / Seminar08 / inorder-traversal.cpp
diff options
context:
space:
mode:
Commit22a1fec9eedd614023e654b0377a1cba6e6978f3 (patch)
Author
 Martin Skachkov <mgsemailbox@gmail.com>
2022-12-03 13:26:02 +0200
Committer
 Martin Skachkov <mgsemailbox@gmail.com>
2022-12-03 13:26:02 +0200
Fileseb215b27ed77b847407d823068d85862a8ce0e0b /Seminar08/inorder-traversal.cpp
Data-structures-and-algorithms-22a1fec9eedd614023e654b0377a1cba6e6978f3.tar
Data-structures-and-algorithms-22a1fec9eedd614023e654b0377a1cba6e6978f3.tar.gz
Data-structures-and-algorithms-22a1fec9eedd614023e654b0377a1cba6e6978f3.zip
Parentfdc3c73cd900aa30b25235fbf535447a700f5a8e (diff)
add solutions
1 files changed, 23 insertions, 0 deletions
-rw-r--r--Seminar08/inorder-traversal.cpp23
diff --git a/Seminar08/inorder-traversal.cpp b/Seminar08/inorder-traversal.cpp
new file mode 100644
index 0000000..7c7fb73
--- /dev/null
+++ b/Seminar08/inorder-traversal.cpp
@@ -0,0 +1,23 @@
+#include "tree-utils.h"
+
+template <typename T>
+void inorderTraversal(Tree<T> *tree) {
+ if (tree == nullptr) {
+ return;
+ }
+
+ inorderTraversal(tree->left);
+ std::cout << tree->data << ' ';
+ inorderTraversal(tree->right);
+}
+
+int main() {
+ Tree<int> *root = new Tree<int>(8, new Tree<int>(3, new Tree<int>(1), new Tree<int>(6, new Tree<int>(4), new Tree<int>(7))), new Tree<int>(10, nullptr, new Tree<int>(14, new Tree<int>(13))));
+
+ inorderTraversal(root); //изпечатва елементите на дървото сортирано
+ std::cout << '\n';
+ printTree(root);
+
+ freeTree(root);
+ return 0;
+} \ No newline at end of file