In the computational strategy to implement a tree with an array, the children of node n are stored at 2n + 1 and 2(n + 1) respectively.

Name: In the computational strategy to implement a tree with an array, the children of node n are stored at 2n + 1 and 2(n + 1) respectively.
Brand: Quizplus
Rating: 4.8 (27 reviews)

Question

Quizplus · Accepted Answer

In a binary tree implemented using an array, the children of the node at index n are found at indices 2n + 1 (for the left child) and 2(n + 1) (for the right child), assuming the indexing starts at 0.

In the Computational Strategy to Implement a Tree with an Array