bst ..

Author: dev-jko

tree/binary_search_tree/README.md

@@ -10,6 +10,7 @@
 	typedef struct	s_node
 	{
 		void		*data;
+		struct s_node	*parent;
 		struct s_node	*left;
 		struct s_node	*right;
 	}		t_node;

tree/binary_search_tree/implementation_example/binary_search_tree.c

@@ -6,7 +6,7 @@
 /*   By: jko <jko@student.42seoul.kr>               +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2020/04/04 21:13:23 by jko               #+#    #+#             */
-/*   Updated: 2020/04/04 21:51:32 by jko              ###   ########.fr       */
+/*   Updated: 2020/04/04 23:42:57 by jko              ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
@@ -32,6 +32,7 @@ t_node	*create_elem(void *data)
 	if (!node)
 		return (0);
 	node->data = data;
+	node->parent = 0;
 	node->left = 0;
 	node->right = 0;
 	return (node);
@@ -93,29 +94,62 @@ int	tree_insert(t_tree *tree, void *data)
 		prev->left = new;
 	else
 		prev->right = new;
+	if (prev)
+		new->parent = prev;
+	tree->size++;
 	return (1);
 }
 
+static t_node	*find_next_bigger_parent(t_node *curr)
+{
+}
+
 int	tree_delete(t_tree *tree, void *data_ref, void (*free_data)(void *))
 {
+	t_node	*parent;
 	t_node	*curr;
+	t_node	*temp;
 	int	cmp_result;
 
-	if (!tree || !free_data)
+	if (!tree || !free_data || tree_size(tree) == 0)
 		return (0);
 	curr = tree->root;
-	if (tree->cmp(data_ref, tree->root))
 	while (curr)
 	{
-		if (!(cmp_result = tree->cmp(data_ref, curr->data)))
+		if ((cmp_result = tree->cmp(data_ref, curr->data)))
+			break ;
+		if (cmp_result < 0)
+			curr = curr->left;
+		else
+			curr = curr->right;
+	}
+	if (!curr)
+		return (0);
+	if (!curr->parent)
+		tree->root = 0;
+	temp = curr;
+
+	if (!curr->left && !curr->right)
+		curr = 0;
+	else if (curr->left && curr->right)
+	{
+		curr = curr->right
+		while (curr->left && curr->right)
 		{
-			free_data(curr->data);
-			free(curr);
 
-			return (1);
 		}
 	}
+	else
+		curr = curr->left ? curr->left : curr->right;
 
+	if (cmp_result < 0)
+		prev->left = curr;
+	else
+		prev->right = curr;
+	free_data(temp->data);
+	free(temp);
+	tree->size--;
+	return (1);
 }
 
 void	free_tree(t_tree *tree, void (*free_data)(void *))

tree/binary_search_tree/implementation_example/tree.h

@@ -6,7 +6,7 @@
 /*   By: jko <jko@student.42seoul.kr>               +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2020/04/04 21:11:12 by jko               #+#    #+#             */
-/*   Updated: 2020/04/04 21:50:29 by jko              ###   ########.fr       */
+/*   Updated: 2020/04/04 23:09:48 by jko              ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
@@ -18,6 +18,7 @@
 typedef struct	s_node
 {
 	void		*data;
+	struct s_node	*parent;
 	struct s_node	*left;
 	struct s_node	*right;
 }		t_node;

tree/binary_search_tree/tree.h

@@ -1,6 +1,7 @@
 typedef struct	s_node
 {
 	void		*data;
+	struct s_node	*parent;
 	struct s_node	*left;
 	struct s_node	*right;
 }		t_node;