Question

i have question for example i want to implement binary tree with array i want understand what will indexes for left child and rigth child ?my array is 0 based i want implement searching in tree using array can anybody help me?

Answer 1

To implement a binary tree as an array you put the left child for node i at 2*i+1 and the right child at 2*i+2.

So for instance, having 6 nodes here’s the indices of the corresponding array

          0
          |
      ---------
      |       |
   ---1--   --2--
   |     |  |    |
   3     4  5    6