AfanasevGad7

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

commit 814898e8678c97ea90538764d4c342b76f81e8ed
parent 4e8a95db7d07715e3b7b61d0c72a48945bcc8bc0
Author: Plat <plat@stellar-nexus.ru>
Date:   Wed,  5 Nov 2025 19:01:55 +0000

Fixed function prototypes

Diffstat:
Mrb.c | 2+-
Mtree.h | 20++++++++++----------
2 files changed, 11 insertions(+), 11 deletions(-)

diff --git a/rb.c b/rb.c @@ -6,7 +6,7 @@ unsigned int steps; -static inline Node * +inline Node * init(int val) { Node *root = emalloc(sizeof(Node)); diff --git a/tree.h b/tree.h @@ -12,13 +12,13 @@ typedef struct Node { struct Node *left, *right; } Node; -Node* init(int); -Node* add(int, Node*); -Node* parse_pre(Node*); -Node* parse_post(Node*); -Node* parse_inf(Node*); -int get_height(Node*); -Node* balance(Node*); -Node* left_turn(Node*); -Node* right_turn(Node*); -Node* search(Node*, int); +inline Node *init(int); +Node *add(Node *, int); +Node *parse_pre(Node *); +Node *parse_post(Node *); +Node *parse_inf(Node *); +int get_height(Node *); +Node *balance(Node *); +Node *left_turn(Node *); +Node *right_turn(Node *); +Node *search(Node *, int);