Website Summary Files Commits Branches @commit @diff @stats
path: root / Seminar09 / exam1.cpp
diff options
context:
space:
mode:
Commitc1b3267208163f17c08d545f805f0b412d35d377 (patch)
Author
 Stoycho Kyosev <stoycho.kk@gmail.com>
2022-12-21 15:11:33 +0200
Committer
 Stoycho Kyosev <stoycho.kk@gmail.com>
2022-12-21 15:11:33 +0200
Files8f575a3f23bd23b1ddc647bf11469e7ccf943d33 /Seminar09/exam1.cpp
Data-structures-and-algorithms-c1b3267208163f17c08d545f805f0b412d35d377.tar
Data-structures-and-algorithms-c1b3267208163f17c08d545f805f0b412d35d377.tar.gz
Data-structures-and-algorithms-c1b3267208163f17c08d545f805f0b412d35d377.zip
Parent7055aa447180a95665a565e9b1f74853ef4a3b8a (diff)
fix leak
1 files changed, 1 insertions, 20 deletions
-rw-r--r--Seminar09/exam1.cpp21
diff --git a/Seminar09/exam1.cpp b/Seminar09/exam1.cpp
index e8d4526..26eb3cb 100644
--- a/Seminar09/exam1.cpp
+++ b/Seminar09/exam1.cpp
@@ -31,24 +31,5 @@ int findSum(const Tree<int>* t, int x, int y) {
}
int main() {
- Tree<int>* root = new Tree<int>(50);
- Tree<int>* n1 = new Tree<int>(25);
- Tree<int>* n2 = new Tree<int>(75);
- Tree<int>* n3 = new Tree<int>(12);
- Tree<int>* n4 = new Tree<int>(30);
- Tree<int>* n5 = new Tree<int>(60);
- Tree<int>* n6 = new Tree<int>(85);
- Tree<int>* n7 = new Tree<int>(52);
- Tree<int>* n8 = new Tree<int>(70);
-
- root->left = n1;
- root->right = n2;
- n1->left = n3;
- n1->right = n4;
- n2->left = n5;
- n2->right = n6;
- n5->left = n7;
- n5->right = n8;
-
- std::cout << findSum(root, 30, 75);
+
} \ No newline at end of file