algorithm_study/05_tree/1_binary_search_tree/tree.h at master · 365kim/algorithm_study · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   tree.h                                             :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: mihykim <mihykim@student.42seoul.kr>       +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2020/04/06 13:49:57 by mihykim           #+#    #+#             */
/*   Updated: 2020/04/08 23:26:18 by mihykim          ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#ifndef TREE_H
# define TREE_H

# define LEFT 1
# define RIGHT -1

# define EQUAL 0

# define SUCCESS 1
# define FAIL 0

#include <stdlib.h>

typedef struct		s_node
{
	void			*data;
	struct s_node	*left;
	struct s_node	*right;
}					t_node;

typedef struct	s_binary_search_tree
{
	t_node		*root;
	int			(*cmp)(void *, void *);
	int			size;
}				t_tree;

t_tree	*tree_init(int (*cmp)(void *, void *));
t_node	*create_elem(void *data);
int     tree_size(t_tree *tree);
t_node	*tree_find(t_tree *tree, void *data_ref);
int     tree_insert(t_tree *tree, void *data);
int     tree_delete(t_tree *tree, void *data_ref, void (*free_data)(void *));
void	free_tree(t_tree *tree, void (*free_data)(void *));

#endif