Python Programming(Binary tree)

Write a python program named quiz_10

fowlling the below sample outputs.

Sample outputs (revised) $ python3 quiz 10.py Enter 2 nonnegative integers, the second one no greater than 100: 0 3 The heap that has been generated is: [None, 27, 12, 24] The preferred ordering of data to generate this heap by successsive insertion is: [12, 24, 27] $ python3 quiz.10 Enter 2 nonnegative integers, the second one no greater tha 100: 0 5 The heap that has been generated is: py None, 48, 24, 26, 2, 16) The preferred ordering of data to generate this heap by successsive insertion is: [2, 26, 48, 16, 24] $ python3 quiz 10.py Enter 2 nonnegative integers, the second one no greater than 100: 0 7 The heap that has been generated is: [None, 65, 53, 62, 33, 49, 5, 51] The preferred ordering of data to generate this heap by successsive insertion is: [33, 49, 5, 53, 62, 51, 65] $ python3 quiz 10 .py Enter 2 nonnegative integers, the second one no greater tha 100: 0 10 The heap that has been generated is: [None, 97, 61, 65, 49, 51, 53, 62, 5, 38, 33] The preferred ordering of data to generate this heap by successsive insertion is: [5, 53, 62, 33, 38, 65, 97, 49, 51, 61] $ python3 quiz 10.py Enter 2 nonnegative integers, the second one no greater tha 100: 0 15 The heap that has been generated is: None, 149, 130, 129, 107, 122, 124, 103, 66, 77, 91, 98, 10, 55, 35, 72] The preferred ordering of data to generate this heap by successsive insertion is: [66, 91, 10, 107, 122, 35, 55, 77, 130, 98, 149, 124, 129, 72, 103]