AfanasevGad7

This is a task for our favourite professor
git clone git://git.stellar-nexus.ru/AfanasevGad7
Log | Files | Refs

commit 2824f37bf18e52e0f565437e4303f6d97c787915
Author: Plat <plat@stellar-nexus.ru>
Date:   Sat, 18 Oct 2025 14:42:04 +0000

Initial commit

Diffstat:
A1.docx | 0
Ahelp.txt | 43+++++++++++++++++++++++++++++++++++++++++++
2 files changed, 43 insertions(+), 0 deletions(-)

diff --git a/1.docx b/1.docx Binary files differ. diff --git a/help.txt b/help.txt @@ -0,0 +1,42 @@ +#include <iostream> + + +#define MAX(A, B) ((A) > (B) ? (A) : (B)) +#define MIN(A, B) ((A) < (B) ? (A) : (B)) +#define BETWEEN(X, A, B) ((A) <= (X) && (X) <= (B)) +#define LENGTH(X) (sizeof(X) / sizeof(X)[0]) + + +class BinaryTree { +public: + + struct Node { + int val; + Node *right; + Node *left; + }; + + Node *tree; + Node *root = 0; + + + BinaryTree() { + const int s = pow(10, 6); + tree = (Node*)malloc(sizeof(Node) * s); + } + + + void add(int val) { + if (root == 0) { + + } + } + + +}; + + + +int main() { + +} +\ No newline at end of file