Redirected
987 views
2 votes
2 votes
Recall that a list of elements is called a binary min-heap if in its tree representation, the root is the smallest in magnitude compared to its left and right subtrees. Out of all the possible permutations of {1, 2, 3, 4, 5, 6, 7}, a permutation is picked at random. The probability that the permutation satisfies the min-heap property is ________. (Upto 3 decimal places)

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
Ray Tomlinson asked Aug 9, 2023
272 views
what they want to tell and it is true or false?
0 votes
0 votes
1 answer
3
Ray Tomlinson asked Aug 9, 2023
461 views
How many times is the comparison $i >= n$ performed in the following program?int i = 200 n = 80; main() { while (i >= n) { i = i - 2 n = n + 1 } }