Home/ Questions/Q 842497
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-15T05:58:21+00:00

i have question for example i want to implement binary tree with array i

  • 0

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?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    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
    • 0