Suppose integers arrive in the following order for insertion in a binary tree with an ordering property: 72 38 25 66 tl 100 5 3 2 ttz 7t 29 7 6 24 Then delete 38, 12 and25. Draw the resulting tree (final state after insertions and step by step for deletions), discuss its fullness, and categorize its search efficiency in Big-O terms.

Read the code below. what will the computer print if the input for year_variable is 1700? if year_variable == 1776: print("your answer is correct. the declaration of independence was signed in “year_variable”.") elif year_variable < 1776: compute_variable = 1776 - year_variable. print("add “compute_variable“ years to your answer for the correct answer.") elif year_variable > 1776: compute_variable = year_variable - 1776 print("subtract “compute_variable” years from your answer for the correct answer.")