Website Summary Files Commits Branches @commit @diff @stats
path: root / Seminar08 / inorder-traversal.cpp
diff options
context:
space:
mode:
Commit7eee5a78005a9a569186d2c8b4b645a818ab9bf1 (patch)
Author
 Stoycho Kyosev <skyosev@192.168.100.17>
2024-10-06 07:04:44 -0400
Committer
 Stoycho Kyosev <skyosev@192.168.100.17>
2024-10-06 07:04:44 -0400
Files84594e0af29cefa5aae76ace5f8eb81484400e31 /Seminar08/inorder-traversal.cpp
Data-structures-and-algorithms-7eee5a78005a9a569186d2c8b4b645a818ab9bf1.tar
Data-structures-and-algorithms-7eee5a78005a9a569186d2c8b4b645a818ab9bf1.tar.gz
Data-structures-and-algorithms-7eee5a78005a9a569186d2c8b4b645a818ab9bf1.zip
Parent0841635826cb03c0e74cd75ec3c97c4c3b594d8b (diff)
Cleanup
1 files changed, 0 insertions, 23 deletions
-rw-r--r--Seminar08/inorder-traversal.cpp23
diff --git a/Seminar08/inorder-traversal.cpp b/Seminar08/inorder-traversal.cpp
deleted file mode 100644
index c9a9bd6..0000000
--- a/Seminar08/inorder-traversal.cpp
+++ /dev/null
@@ -1,23 +0,0 @@
-#include "tree-utils.h"
-
-template <typename T>
-void inorderTraversal(const 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