From 7eee5a78005a9a569186d2c8b4b645a818ab9bf1 Mon Sep 17 00:00:00 2001 From: Stoycho Kyosev Date: Sun, 6 Oct 2024 07:04:44 -0400 Subject: Cleanup --- Seminar09/exam1.cpp | 35 ----------------------------------- 1 file changed, 35 deletions(-) delete mode 100644 Seminar09/exam1.cpp (limited to 'Seminar09/exam1.cpp') 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 findSumHelper(const Tree* t, int x, int y) { - if(t == nullptr) - return std::make_pair(0, 0); - - std::pair l = std::make_pair(0, 0); - std::pair 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* t, int x, int y) { - return findSumHelper(t, x, y).first; -} - -int main() { - -} \ No newline at end of file -- cgit v1.3.1-26-gb76a