Using Python's built-in defaultdict we can easily define a tree data structure:
def tree(): return defaultdict(tree)That's it!
| __credits__ = ["https://finxter.com/"] | |
| def quick_sort(data:list)->list: | |
| if not data: return [] | |
| return quick_sort([x for x in data[1:] if x< data[0]]) + data[0:1] + quick_sort([x for x in data[1:] if x>=data[0]]) |
Using Python's built-in defaultdict we can easily define a tree data structure:
def tree(): return defaultdict(tree)That's it!