Your question:

If the elements of the fist L are ∣×1×2×3,×4,×5×6,…10) then the constructed aimost binary tree would bes in the fobsowng manner. An almost complete binary tree is a binary tree that satisfies the following conditions: I) Insertion of nodes must take place level by level and all the nodes must be left justified. II) All the levels from 1 to h−1 level(h stands for the number of levels) should be completely filled without any gap. Read the input from STDIN and print the output to STDOUT. Do not write arbitrary strings while reading the input or while printing, as these contribute to the Constraints: i) Element should not be negative ii) Consider that every test case has at least one even number in its input ii) 3<=N<=15000

Assignment Help Answers with Step-by-Step Explanation:

    binary_tree = [None] * len(elements)

    # Start building the tree level by level

            if index < len(elements):

                binary_tree[index] = elements[index]

    elements = [int(x) for x in input().split()]

    # Build the almost complete binary tree

    while index < len(binary_tree):

        print(f"Level {level}: ", end="")

        print()

        level += 1