Application:remove duplicates in a list

input: a list L of integers (e0,e1,...,en-1)

output: a list of sorted elements in L without duplicates

t = maketree(e0);

for each ei (i=1,...,n-1) {

q = search(t,e0);

if (ei == q->info)

printf(“%d is duplicated”,ei);

else if (ei < q->info)

setleft(q,ei);

else setright(q,ei);

}

output in-order traversal of t

Previous slide

Next slide

Back to first slide

View graphic version