Sort without duplicates (2)

Write a function sort_no_dup that receives a list of integers, possibly including repeated entries, and returns a sorted list with the same integers without any repetition. The solution must use compulsorily a binary search tree (BST).

Input

The function receives a list of integers as a parameter.

Output

The function returns as a result a list of integers sorted and without duplicate elements.

Observation

Besides integers, only a total of three data structures are to appear in your solution: the parameter list, the returned resulting sorted list, and one BST to be implemented by you.

Problem information

Author: ProAl

Generation: 2026-01-25T17:33:17.995Z

© Jutge.org, 2006–2026.
https://jutge.org