I just need the answer of the first part of the question!!

Given the following structure that represents the building block of a binary tree. const int MAX_CHILD=2; struct Node\{ int index; int data; int child_count; int children[MAX_CHILD]; int color; // -1(uncolored) , 1(White), 0 (Black) int bf; // balance factor \}; Write complete C program to do the following: 1. Implement a function to create two binary search trees (BST) from a file already arranged to include BST. Use the following file (as an example) to construct each tree. 6 (count of nodes in tree) Index/data/count_child/ child0.../ initial-color