Hey guys. Last week I programmed a AVL tree. This week i am trying to build a Btree. Can someone explain the differences between a AVL tree and a Btree. They seem kind of similar in the sense that both need balancing, but how different are they when it comes to coding them? Can I possibly just modify my AVL tree code and make it a Btree? Any suggestion would be much appreciated. Thanks.