stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
Data Structures & SOrting & Infix LONGG Flashcards | StudBud
Data Structures & SOrting & Infix LONGG
1 / 30
While deleting nodes from a binary heap, ---____node is replaced by the last leaf in the tree.
A
left leaf
B
cycle
C
root
D
right leaf
Next
0
0
correct · 0:00
