If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?
(a) 2i+1
(b) 2i+2
(c) 2i
(d) 4i
Question is taken from Binary Trees topic in division Binary Trees of Data Structures & Algorithms I
I got this question during an internship interview.