Question 1121 – Nielit Scientist-B CS 22-07-2017
December 6, 2023Question 8119 – Regular-Language
December 6, 2023Question 13006 – Data-Structures
If a complete binary tree with n nodes is represented sequentially using array then for any node with index i, 1 ≤ i ≤ n we have:
Correct Answer: B
Question 637 Explanation:
Option B is the correct answer.Take some complete binary tree and check it.
Right-CHILD(i) is at 2i + L, if 2i + 1 ≤ n
Right-CHILD(i) is at 2i, if 2i ≤ n
Right-CHILD(i) is at 2i -1, if 2i -1 ≤ n
None of the above
Subscribe
Login
0 Comments