if (compare leftChild);
else
  nodeLocation = &((*nodeLocation)->rightChild);

Discussion

1. I’d go with your creative solution. They mark it on output and as long as you make comments and it is the right solution, they will give you the marks. I would greatly like to see the code (after mine is done, of course) and get an explaination. I’m going to stick to the cases, as it’s what I know. Safe.

   Posted at 12:54 am on July 15th by Jeffrey Aho.

2. Basically, I guess it ends up being a discussion about abstraction. The more ‘levels’ something can be abstracted in, the more ‘[bottom-uppy](http://www.paulgraham.com/progbot.html)’ the code is, and hence more reusable.

   Posted at 1:50 pm on July 15th by Mike Purvis.

3. Well, personally, I can’t really picture programming without pointer-pointers (and crazier things once the data structures get more interesting).

   I guess you engineers are probably working in C as opposed to C++? In C++, if you aren’t worried at all about performance, you can write some very tight binary tree code using classes and recursive calls (I seem to recall one that actually stored extra leaf nodes that contain no data, but simplified the cases, allowing very short methods.)

   The only reason to be using C these days is if you’re really performance paranoid, in which case you ought to be pretty comfortable with strange pointer operations.

   Posted at 3:18 pm on July 17th by Daniel Dresser.

4. Yeah, well my previous pointer experience had been with Pascal, which is pretty touchy about those weirder things. PHP doesn’t have pointers at all, in part, I expect, for stability, and simply because nested associative arrays are such a powerful structure.

   This is supposed to be an introductory course for deer-in-the-headlight folks whose only prior experience is, you know, last year’s C++ course.

   Anyhow, yeah, once I drew a little diagram and got the stars and ampersands in the right places, it worked like a charm. But still, it would depend who else was seeing the code. Me in six months would probably still get it. But would co-worker X get it?

   BTW, if you’re even in Waterloo before September, Dan, you need to stop by for dinner so you can get USB mice working on my Gentoo…

   Posted at 4:14 pm on July 17th by Mike Purvis.

5. Hey Mike, I’m done the assignment, but after Monday, would you mind showing me the explaination for this code? Looks like a great idea, if only I could get what you’re trying to say here..

   Posted at 6:20 pm on July 22nd by Ryan Hildebrandt.

6. I ‘discovered’ exactly this same thing a few weeks ago. It’s a neat solution and I see no reason not to use it. If you are worried about not understanding your code in a few weeks, just make sure you write good comments.

   Another trick useful for linked lists is to create dummy head and tail elements of exactly the same type as the real elements. This way you completely avoid any special cases when adding or removing items from the ends of the list because you are inserting *between* two existing elements (one of which is the dummy).

   Posted at 6:18 pm on August 17th by Ian.