Write a function to construct a binary search tree given a string in postorder notation ("abcdefg").
Anónimo
int i=0; struct node *nthlast = NULL; struct node *tmp = head; while (tmp) { if (nthlast) { nthlast = nthlast -> next; tmp = tmp->next; continue; } i++; if (i == n) nthlast = head; tmp = tmp->next; } return (nthlast);