Internals

• It is single threaded and has event loop.
• Implemented using modified Radix trees where leaf nodes are connected by Doubly Linked List in Radix Trie to facilitate the quick lookup of keys/values in sorted order.
• Doubly Linked List of leaf nodes are updated at the time of create/delete and update of keys optimally.
• This structure is similar to Prefix Hash Tree (opens in a new tab), but for Radix Tree and without converting keys to binary.
• Tree Map used to store score maps also are connected internally using Doubly Linked List using similar logic
• For more details - check out the medium article (opens in a new tab)