2-binary_tree_insert_right.c

#include "binary_trees.h"
/**
 * binary_tree_insert_right - function that inserts a node
 * as the right-child of another node
 * @parent: is a pointer to the node to insert the right-child in.
 * @value: is the value to store in the new node.
 * Return: pointer to the created node, or NULL on failure or if parent is NULL
 */
binary_tree_t *binary_tree_insert_right(binary_tree_t *parent, int value)
{
	binary_tree_t *new_right_node = NULL;

	if (parent == NULL)
	{
		return (NULL);
	}

	new_right_node = malloc(sizeof(binary_tree_t));
	if (new_right_node == NULL)
	{
		free(new_right_node);
		return (NULL);
	}

	new_right_node->n = value;
	new_right_node->left = NULL;
	new_right_node->right = NULL;
	new_right_node->parent = parent;

	if (parent->right == NULL)
	{
		parent->right = new_right_node;
	}
	else
	{
		new_right_node->right = parent->right;
		parent->right->parent = new_right_node;
		parent->right = new_right_node;
	}

	return (new_right_node);

}