rpiper138

Just a hint since I see a lot of code in here that is huge for what it is trying to do: Build the tree recursively using the pre-order array(The in order array will cause you to have an unbalanced tree). The function to do this is 5 lines or …

This is an MSSQL API call and it will only get you the diag info that is directly involved in the previous action or transaction on the current connection. rc = SQLExecDirect(hstmt, SQLStmt, SQL_NTS); if ((rc == SQL_SUCCESS_WITH_INFO) || (rc == SQL_ERROR)) { i = 1; while ((SQLGetDiagRec(SQL_HANDLE_STMT, hstmt, i, …

What did your core file tell you? I don't have a linux machine to test it on and it is fine on my Sun, but it is probably a different architecture than you are using. Generally Unix segmentation faults on a free are caused by over running a dynamic allocation. …

You might find it easier to read the first packet into a 32 byte allocation (via malloc). Read the size via an overlay of the struct defined way at the top (has the preamble, size and end points). Realloc the current allocation to the size that you need and set …

unsigned char values[4] = (char[]) 0xBC1E0400; //Read from file stream long result; for(int i=4;i<4;i++) ((char*)&result)[4-i] = values[i];

What are you trying to do????? Shorten the program. It will make it easier to compile. SetLetter and SetNumber don't have returns for all paths and are far too long for what they do. [CODE=C] char setletter(int set[], int x) { char value = (char)((set[x]) + 0x60); //0x61 is lower …

This is not a difficult function nor is it well written. I would suggest starting with pseudo code (including error handling) and then writing the actual code.