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 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 …
Jump to Post>You didn't click the link I gave you right?
You mean the link to my AVL tree tutorial? Yea, that's a real good B-Tree resource... :icon_rolleyes:p.s. A B-Tree tutorial is on my list, but I haven't written anything for it yet.
All 9 Replies
bamcclur 0 Newbie Poster
Well, 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 http://en.wikipedia.org/wiki/Btree
UberJoker 0 Junior Poster in Training
I have already read that...my question was can somebody point out the exact differences between the two and where the modifications need to be done in an AVL tree to make it a Btree.
Narue 5,707 Bad Cop Team Colleague
>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 order than AVL trees (which are generally strictly binary). B-Trees are generally external data structures rather than internal because the node structure is well-suited to more expensive access of secondary storage.
The balancing algorithms are very different as well. Rather than storing balance factors and rotating, B-Trees use a fill-factor (how much of the node is full) and then split or merge adjacent nodes accordingly.
>Can I possibly just modify my AVL tree code and make it a Btree?
Not really. You'll find it easier to start from scratch with a B-Tree rather than convert an AVL tree to a B-Tree...
UberJoker 0 Junior Poster in Training
I was trying to find a good explanation online as to how to code a Btree but I coudnt find anything ....can you possibly direct me to a good source to begin.
Nick Evan 4,005 Industrious Poster Team Colleague Featured Poster
I was trying to find a good explanation online as to how to code a Btree but I coudnt find anything ....can you possibly direct me to a good source to begin.
You didn't click the link I gave you right?
Narue 5,707 Bad Cop Team Colleague
>You didn't click the link I gave you right?
You mean the link to my AVL tree tutorial? Yea, that's a real good B-Tree resource... :icon_rolleyes:
p.s. A B-Tree tutorial is on my list, but I haven't written anything for it yet.
Nick Evan 4,005 Industrious Poster Team Colleague Featured Poster
>You didn't click the link I gave you right?
You mean the link to my AVL tree tutorial? Yea, that's a real good B-Tree resource... :icon_rolleyes:
Well, err, yeah... I guess my brain misfired, sorry 'bout that one. :icon_sad:
dilkash 0 Newbie Poster
luv u dear ma sweet heart muuuuaaaaaaaaaaahhhhhhhhhhhhhhh..........
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.