collapse a binary search tree into a sorted list

Question

aba · Accepted Answer

In-order traversal of the tree should do it.

Anonimo · Answer

PseudoCode

Collapse(node N, list L)
{
	if (N.left)
		Collapse(N.left)
	L.add(node.value)
	if (N.right)
		Collapse(N.right)
}

List SL;
Collapse(root, SL);

Raviteja Ainampudi · Answer

#!/usr/bin/python3

def collapse(binarytree, sorted_list = []):
    if binarytree:
        collapse(binarytree.left)
        sorted_list.append(binarytree.value)
        collapse(binarytree.right)
    return sorted_list

print(collapse(binarytree))

Anonimo · Answer

depth first search

Apple

Domanda di colloquio di Apple

Risposte di colloquio

Aziende seguite

Ricerche di lavoro