Data Structure-heap allocation of strings

# Include <stdio. h> # include <stdlib. h> typedef struct {char * Ch; int length;} hstring; void strassign (hstring & T, char * chars); void strlength (hstring S); void strcompare (hstring s, hstring T); void clearstring (hstring & S); void Concat (hstring & T, hstring S1, hstring S2); void substring (hstring S, int POs, int Len ); void main () {} void strassign (hstring & T, char * chars) {If (T. ch) Free (T. ch); for (I = 0, c = chars; C; I ++, C ++); If (! I) {T. Ch = NULL; T. Length = 0;} else {If (! (T. Ch = (char *) malloc (I * sizeof (char) {printf ("error! \ N "); return;} For (j = I; j> = 1; j --) T. ch [J-1] = chars [J-1]; T. length = I ;}} void strlength (hstring s) {printf ("the length of string is: % d \ n", S. length);} void strcompare (hstring S, hstring t) {for (I = 0; I <S. length & I <t. length; I ++) if (S. ch [I]! = T. Ch [I])}