Computer Science - Data Structures - Heaps - Heap Operations

P1: 'Min-heap: [1, 3, 2, 7, 4, 5]. Left child of index 1 (value 3)?' → index 2*1+1 = ___ (value ___) [3, 7]. P2: 'Insert 0 into [1,3,2,7,4,5]. After bubble up, 0 ends at index?' → ___ [0 - it becomes the root]. P3: 'Extract min from [1,3,2,7,4,5]. After removal, root becomes?' → ___ [2 - last elemen