Tricky Segmentation faults with BST recursion in C
问题 I'm trying to add strings to a Binary Search Tree using a recursive insert method (the usual for BSTs, IIRC) so I can later print them out using recursion as well. Trouble is, I've been getting a segmentation faults I don't really understand. Related code follows (this block of code is from my main function): #include <stdio.h> #include <stdlib.h> #include <string.h> #include <ctype.h> // Stores the size of the C-strings we will use; // Standardized to 100 (assignment specifications say //