Website Summary Files Commits Branches @commit @diff @stats
path: root / Seminar09 / exam1.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 /Seminar09/exam1.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, 35 deletions
-rw-r--r--Seminar09/exam1.cpp35
diff --git a/Seminar09/exam1.cpp b/Seminar09/exam1.cpp
deleted file mode 100644
index 26eb3cb..0000000
--- a/Seminar09/exam1.cpp
+++ /dev/null
@@ -1,35 +0,0 @@
-#include"../Seminar08/tree-utils.h"
-
-// pair.first -> Сумата до момента
-// pair.second - Броя на наследниците, които изпълняват условието ключовете им да влизат в интервала в поддървото
-std::pair<int, int> findSumHelper(const Tree<int>* t, int x, int y) {
- if(t == nullptr)
- return std::make_pair(0, 0);
-
- std::pair<int, int> l = std::make_pair(0, 0);
- std::pair<int, int> r = std::make_pair(0, 0);
-
- if(t->data >= x)
- l = findSumHelper(t->left, x, y);
-
- if(t->data <= y)
- r = findSumHelper(t->right, x, y);
-
- bool oddChildren = ((l.second + r.second) % 2);
-
- int sum = l.first + r.first;
- int count = l.second + r.second + (t->data >= x && t->data <= y);
-
- if(oddChildren)
- sum += t->data;
-
- return std::make_pair(sum, count);
-}
-
-int findSum(const Tree<int>* t, int x, int y) {
- return findSumHelper(t, x, y).first;
-}
-
-int main() {
-
-} \ No newline at end of file