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
no subject
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