Datastructure or algo heap addons implementation

I'm guessing what you're thinking buddies memory allocation ? There's a link to the Wikipedia page. He mentions:

Usually a buddy system memory allocation is implemented using a binary tree to represent used or unused blocks of shared memory.

If you find it difficult to understand the Wikipedia entry, can you possibly update your question to clarify which part of your problem is?