☑Kizspy.me
(Choose 1 answer)
☐ A
Assume that a Binary Trees T is represented as Array-Based Representation (root is stored at index 1) and a
node X is stored at index 3. What is position of the left child of X?
Back
Next
FUO.sh
sh the exam.
A. 3
B. 5
C. 6
D. 7
