(no subject)

[logomancer]

So I'm back in C-Ville, and all's well so far. I've been busy getting the components to my costume for TCon. Mom's been complaining about the price. I don't see why, since I'm paying for most of it. She's also whining about how I'm being a stickler for perfectionism. Since this is a military costume (TCon's theme this year is military sci-fi), I think the perfectionism is justified. But she still whines about it. *sigh*

My Chem grades were posted. 84 on the Chem test, 95(!) on the lab test. I guess I'll get the rest of the grades when I get back. I'm mildly worried. I might have sucked on my DSII test, but I'm banking that the rest of the group will suck more. CpE's a wild card, though I think I did OK. DiffEQ I got back last week, which was a 64 -- integration is not my strong suit.

I got handed a major project for DSII before I left. Here it is. I have no frelling clue how I'm going to do all of this, so I'm going to try to work on getting an AVL tree working and proceed from there. The main problem that has been plaguing me regarding that is the mechanism for rotating the nodes -- they've never really explained how to do that in class. That and how to implement an in-order traversal iterator. When I figure those out, I'll be set. But I'm still panicking at the large scale of the project at this point.

Comments

[cxi162.livejournal.com]

Eh, with Google these days if you missed it in class it's no big deal. Try "avl tree node rotate". BackInMyDay(tm) it wasn't so easy to look things up. The project is big, but if you get the AVL tree working that's 90% of it. Throw in an STL list, some command processing and you're done.

In-order traversal is simple. Here's some recursive pseudo code. You can also do it iteratively, but it's more complex:

 inorder(tree)
 begin
     if tree is null, return;

     inorder(tree.left_subtree);
     print(tree);
     inorder(tree.right_subtree);
 end