Files
prog.l_ada/2 semestr/Homework/Trees/head.h
T
2023-09-11 17:15:34 +03:00

18 lines
440 B
C

typedef struct tnode
{
int field;
struct tnode *left;
struct tnode *right;
struct tnode *parent;
} tree;
tree *init_root(tree *root, int field);
tree *add_node(tree *root, int field);
tree *find_node(tree *root, int field);
tree *minim(tree *root);
tree *maxim(tree *root);
tree *findForDel(tree *root);
tree *del_node(tree *root, int field);
void preorder(tree *root);
void inorder(tree *root);
void postorder(tree *root);