In which data structure that implements a complete binary tree within an array such that every parent node as a value that is less than the value of either of each children?
Answers
Answered by
0
Answer:
Explanation:
For the above tree, we start with 20, then we move left 8, we keep on moving to left until we see NULL. Since left of 4 is NULL, 4 is the node with minimum value.
Answered by
0
Answer:
binary heap
Explanation:
Similar questions