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.
UberJoker
0
Junior Poster in Training
Recommended Answers
Jump to PostWell, Btrees can have more than two paths spanning from each node, so I think you could generally use your AVL tree, and do some modifications to it. Why not do some reading on how to balance your Btree
Jump to Post>They seem kind of similar in the sense that both need balancing,
>but how different are they when it comes to coding them?
Barring the fact that they're both trees and they're both balanced, AVL and B-Trees are quite different. The biggest difference is that B-Trees usually have a higher …
All 9 Replies
bamcclur
0
Newbie Poster
UberJoker
0
Junior Poster in Training
Nick Evan
4,005
Industrious Poster
Team Colleague
Featured Poster
Narue
5,707
Bad Cop
Team Colleague
UberJoker
0
Junior Poster in Training
Nick Evan
4,005
Industrious Poster
Team Colleague
Featured Poster
Narue
5,707
Bad Cop
Team Colleague
Nick Evan
4,005
Industrious Poster
Team Colleague
Featured Poster
dilkash
0
Newbie Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.