Question: C Programming Structure Name Bin TreeNode (typedef Binary TreeNode) Fields void* data struct _Bin TreeNode* left struct _Bin TreeNode* right Binary TreeNode* top int itemSize

 C Programming Structure Name Bin TreeNode (typedef Binary TreeNode) Fields void*

data struct _Bin TreeNode* left struct _Bin TreeNode* right Binary TreeNode* top

C Programming

Structure Name Bin TreeNode (typedef Binary TreeNode) Fields void* data struct _Bin TreeNode* left struct _Bin TreeNode* right Binary TreeNode* top int itemSize -Binary Tree (typedef Binary Tree) Functionality The data held by this node. The left child of this node. The right child of this node. The root node of this tree. The size of the data type held by this binary tree in bytes. The name of the data type held by this binary tree as a string. A pointer to a compare function. A pointer to a print function. char* type int (*compare)(void*, void*) void (*print)(void*) Requirement Function Input Parameters Return Value Notes Requirement Function Input Parameters Return Value Notes Requirement Function Input Parameters Return Value Notes Conditions Binary Tree* bintree_initialize(int, char*, int (*) (void*, void*), void (*)(void*)) An integer representing a type size, a char pointer representing a type name, a function pointer to a int(void*,void*) comparison function, and a function pointer to a void(void*) print function. A pointer to an initialized Binary Tree. This function should create and store a binary tree with the appropriate fields and a NULL root node. Conditions Binary TreeNode* bintree_create_node(int, void*) An integer representing a data size and a void pointer to an element. A binary tree node with null child pointers and the data set to match the element. None. Conditions bool bintree insert (Binary Tree*, void*) A pointer to a Binary Tree and a void pointer representing an element. True if the element was inserted successfully. Otherwise false. None. Structure Name Bin TreeNode (typedef Binary TreeNode) Fields void* data struct _Bin TreeNode* left struct _Bin TreeNode* right Binary TreeNode* top int itemSize -Binary Tree (typedef Binary Tree) Functionality The data held by this node. The left child of this node. The right child of this node. The root node of this tree. The size of the data type held by this binary tree in bytes. The name of the data type held by this binary tree as a string. A pointer to a compare function. A pointer to a print function. char* type int (*compare)(void*, void*) void (*print)(void*) Requirement Function Input Parameters Return Value Notes Requirement Function Input Parameters Return Value Notes Requirement Function Input Parameters Return Value Notes Conditions Binary Tree* bintree_initialize(int, char*, int (*) (void*, void*), void (*)(void*)) An integer representing a type size, a char pointer representing a type name, a function pointer to a int(void*,void*) comparison function, and a function pointer to a void(void*) print function. A pointer to an initialized Binary Tree. This function should create and store a binary tree with the appropriate fields and a NULL root node. Conditions Binary TreeNode* bintree_create_node(int, void*) An integer representing a data size and a void pointer to an element. A binary tree node with null child pointers and the data set to match the element. None. Conditions bool bintree insert (Binary Tree*, void*) A pointer to a Binary Tree and a void pointer representing an element. True if the element was inserted successfully. Otherwise false. None

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!