manivannan57

 Profile Answers by manivannan57 

• Jul 11th, 2008

 

Yes, it is possible.
Here is an example of implementing a binary tree:

Consider an attay : a[n];
Place the root in first position.
and let the current position to be i = 0;
place left node at the position: 2i+1
place right node at the position: 2i+2.
Repeat these steps.

kranth.pothuganti

 Profile Answers by kranth.pothuganti 

• Sep 15th, 2009

 

Yes it's possible to implement trees using arrays, root node is place in 0th position.
A node in i^th position will have its left child at 2*i^th position and right child at 2*i + 1^th position.
That's it
It was clearly given in Samanta book.

hrshksh

 Profile Answers by hrshksh 

• May 9th, 2010

 

This questions is ambigious. There are a lot of differences between a tree, k ordered tree, binary tree. There is no harm for any implementation to have array or list as the desired mode of implementation. However, for formula based representation, an array implementation is choosen because of a simple observation.

If a node is at position i then it's left child is 2i and right child 2i+1. This formula assumes that the root node of the B Tree starts as 1. The parent is i/2 if i => 2. 

If the root is placed at position 0 of the array then left child is at 2i+1, and right child at 2i+2. 

A usual formula based representation is in the implementation of binary heap (mix or max)

Vishesh Bibhay

 Profile Answers by Vishesh Bibhay 

• Jul 9th, 2011

 

Hello
A complete binary tree can be represented in an array