By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
424,991 Members | 1,887 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 424,991 IT Pros & Developers. It's quick & easy.

AVL Tree Insertion/Removal Repairs

P: 54
I have Insert, Remove, RotateLeft, and RotateRight all tested and functioning. However, the Insert/Remove are derived from a Binary Search Tree. I'm really lost as to how to determine when and where to call the Rotate functions after my calls to Insert and Remove to make the tree balanced between -1 and 1. I read the wiki article but it didn't do much for me. What advice can you give on the topic or what recommended site can I visit for a nice concrete example?
Nov 14 '10 #1
Share this question for a faster answer!
Share on Google+

Post your reply

Sign in to post your reply or Sign up for a free account.