cppit::Dictionary optimisations #5
Description
Make Dictionary class store values as red-black bynary tree or AVL. Makes searching, inserting and deleting time complexity logarithmic. Currently is O(n).
{{ message }}
Make Dictionary class store values as red-black bynary tree or AVL. Makes searching, inserting and deleting time complexity logarithmic. Currently is O(n).