0. New node

[hima890]

Write a function that creates a binary tree node

Prototype: binary_tree_t binary_tree_node(binary_tree_t parent, int value); Where parent is a pointer to the parent node of the node to create And value is the value to put in the new node When created, a node does not have any child Your function must return a pointer to the new node, or NULL on failure alex@/tmp/binary_trees$ cat 0-main.c

include

include "binary_trees.h"

/**

• main - Entry point

• Return: Always 0 (Success) / int main(void) { binary_tree_t root;

  root = binary_tree_node(NULL, 98);

  root->left = binary_tree_node(root, 12); root->left->left = binary_tree_node(root->left, 6); root->left->right = binary_tree_node(root->left, 16);

  root->right = binary_tree_node(root, 402); root->right->left = binary_tree_node(root->right, 256); root->right->right = binary_tree_node(root->right, 512);

  binary_tree_print(root); return (0); } alex@/tmp/binary_trees$ gcc -Wall -Wextra -Werror -pedantic binary_tree_print.c 0-main.c 0-binary_tree_node.c -o 0-node alex@/tmp/binary_trees$ ./0-node .-------(098)-------. .--(012)--. .--(402)--. (006) (016) (256) (512) alex@/tmp/binary_trees$

[hima890]

I will create a branch and look it up

[hima890]

The task was simple you crate a node then assign it valuse

[hima890]

checker agree