Win a copy of Think Java: How to Think Like a Computer Scientist this week in the Java in General forum!
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic

Applying AVL algorithm to an unbalanced binary search tree

 
Zak Tacc
Greenhorn
Posts: 25
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
I have an method that will rotate an unbalanced node in a Binary Search Tree (it checks a node for balance and then it rotates it accordingly). But if I were to apply it to a Binary Search tree of any size/balance (it will be likely that many nodes will need re-balancing), how could I iterate through the whole tree effectively?

Thanks
 
Campbell Ritchie
Sheriff
Posts: 48921
58
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Not a "beginning" question: too difficult.
Moving thread.
 
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic