1 CMPS 12B Data Structures Assignment 3 Binary Search Tree The purpose of this assignment is to create the functions needed to Binary Search Tree (BST) operations. The assignment will be written in C and you will turn in only the functions required. You will write your own main program to test and validate your BST functions. In this assignment, write all error messages to stderr instead of stdout. You will create files BSTClient.c (for your own use), BST.c and BST.h.

can i get some help with starting this maybe help with making the nodes and inserting

CMPS 12B Data Structures Assignment 3 10 2 6 13 16 4 Binary Search Tree The purpose of this assignment is to create the functions needed to Binary Search Tree (BST) operations The assignment will be written in C and you will turn in only the functions required. You will write your own "main" program to test and validate your BST functions In this assignment, write all error messages to stderr instead of stdout You will create files BSTClient.c (for your own use), BST.c and BST.h BSTClient.c-contains the main) and tests. It is the driver for your BST function testing BST.c BST.h -contain the BST manipulation routines -contains the BST node definition and BSTfunction prototypes [supplied] You BST.h file should contain this exact structure definition and function prototypes // Exported reference type // Tree node to store strings, space must be allocated for the string:s typedef struct BSTObj ( char struct BSTObj struct BSTObj *term leftChild; rightChild; /* string data in each block / /* ptr to left child /*ptr to right child / BSTObj