In Part 4, you write the recursive inner function visit(i) for array_preorder(values) :
def array_preorder(values):
result = []
def visit(i):
# TODO
pass
if values:
visit(0)
return result
Which recursive call pattern correctly fills result in preorder for an array representation?

Question

In Part 4, you write the recursive inner function  visit(i)  for  array_preorder(values) : 
 def array_preorder(values):
    result = []
    def visit(i):
        # TODO
        pass
    if values:
        visit(0)
    return result 
 Which recursive call pattern correctly fills  result  in preorder for an array representation?

Accepted Answer

if i < len(values):
    result.append(values[i])
    visit(2 * i + 1)
    visit(2 * i + 2)

Answer

if i < len(values):
    result.append(values[i])
    visit(i + 1)
    visit(i + 2)

Answer

if i < len(values):
    visit(2 * i + 1)
    result.append(values[i])
    visit(2 * i + 2)

Crowdly

In Part 4, you write the recursive inner function visit(i) for array_preorder...

Want instant access to all verified answers on moodle.medtech.tn?