In an array implementation of a binary tree, the root of the tree is in position 0, and for each node n, n's left child is in position ______ and n's right child is in position ______.

Question

Quizplus · Accepted Answer

The Answer of In an array implementation of a binary tree, the root of the tree is in position 0, and for each node n, n's left child is in position ______ and n's right child is in position ______.

In an Array Implementation of a Binary Tree, the Root