Programming

Hi, all,

I am writing a BST (Binary Search Tree).

What I am concerned about is

Code:

typedef struct BST{
    struct BST *p_left;
    struct BST *p_right;
    void *p_data;
    char *p_key;
    unsigned int *length;
}BST;

I have to malloc some space for p_key.

How many of chars should I malloc?

a) malloc(sizeof(char)*(strlen(insert_p_key))

b) or malloc(sizeof(char)*(strlen(insert_p_key)+1)

For option a), I will strcpy(p_bst->p_key,insert_p_key).

For option b), I will strcpy(xxxxx) and p_bst->p_key[strlen(insert_p_key)]='\0'.

Can anyone tell me which one is correct?

Or both?

What are the advantages and flaws of the two?

Thank u

strlen()+1, to give room for the null terminator. strlen() would be one short.

Don't bother putting a null-terminator on after strcpy, it will already have one.

"u" is not a word.

Thank u

You can thank me by using english. "U" is not a word, and netspeak gibberish isn't allowed here.

Even better, use:

Code:

strdup()