Treap Data Structure

A Treap Data Structure is basically a combination of a binary search tree and a heap.   Binary Search Trees – Deletions and additions of nodes can make the tree unbalanced (heavier on sides, therefore, the property we value about BSTs, the ability to distribute data by equal divisions, goes out of whack). Therefore we …

50 Best Comments in Source Code Ever

This articles lists out some of the best comments ever encountered in source code which are taken from a very famous thread at StackOverflow.