Implement a binary tree

[Sean]

Hi all,

I have a question here regarding implementing Binary Tree.
I understand that Binary Tree can be implemented in one of
the following methods:

1)using nodes with pointers to two children.
2)using an array where children of node with index n are
at indices 2n and 2n+1.

Which of the above methods is more efficient and why is it
so?

Thank you very much in advance.
Sean

[Carl Daniel [VC++ MVP]]

Sean wrote:

Hi all,

I have a question here regarding implementing Binary Tree.
I understand that Binary Tree can be implemented in one of
the following methods:

1)using nodes with pointers to two children.
2)using an array where children of node with index n are
at indices 2n and 2n+1.

Which of the above methods is more efficient and why is it
so?

"Introducti on to Algorithms", by Cormen, Leiserson and Rivest is your
friend. Order a copy from Amazon today.

http://www.amazon.com/exec/obidos/tg...qid=1092319495

-cd

[Peter van der Goes]

"Sean" <an*******@disc ussions.microso ft.com> wrote in message
news:49******** *************** *****@phx.gbl.. .

Hi all,

I have a question here regarding implementing Binary Tree.
I understand that Binary Tree can be implemented in one of
the following methods:

1)using nodes with pointers to two children.
2)using an array where children of node with index n are
at indices 2n and 2n+1.

Which of the above methods is more efficient and why is it
so?

Thank you very much in advance.
Sean

Here's an alternate source for this excellent book.

http://www.bookpool.com/.x/mkx6f7juj...Go.x=17&Go.y=7

--
Peter [MVP Visual Developer]
Jack of all trades, master of none.