Created a basic binary search tree, utilising linkedlists AND also trying to input 'data' into the function (because it requires it). However, I keep getting the 'unused variable' error even though I'm using it?
Is it because I'm not returning 'data'? If so, how am I supposed to when the function itself is supposed to be creating a new node?
Thanks!
/* Binary search trees in linkedlists!
*/
#include <stdio.h>
#include <stdlib.h>
typedef struct tnode Tnode; //Tree node
struct tnode {
int data;
Tnode *left; //for smaller vals
Tnode *right; //for larger vals
};
Tnode * makeTnode( int data );
int main(int argc, char*argv[]){
int data = 9;
struct tnode new_node;
Tnode * makeTnode( int data );
printf("new_node's data is %d\n", new_node.data);
return 0;
}
Tnode * makeTnode( int data ){
Tnode *new_node =(Tnode *)malloc(sizeof(Tnode));
if(new_node == NULL) {
fprintf(stderr, "Error: memory allocation failed\n");
exit(1);
}
new_node->data = data;
new_node->left = NULL;
new_node->right = NULL;
return(new_node);
}