Binary search trees are mostly hard. Writing red-black tree is a nightmare. Here, I'm going to explain one of the easiest, yet efficient and powerful balanced binary tree — treap or cartesian tree
Everything you need to know about new Swift asynchronous features. Async await, main actor, task, async get, and possible use cases — all covered.
I’m going to tell you about the internals of the Mach-O file and give an introduction to the simple relocatable object file structure
Skip List is a nice structure that lets you to perform insertions, searches, and finding n-th maximum. In this post I fokus on skip list indexation