In this post, I will introduce the red black tree, which is a kind of self-balancing binary search tree. Red black tree has more relaxed notion of balance than AVL trees, which is good enough to reduce the searching time and more easy to maintain the tree itself. Since red black tree is also a BST, so some tricky operation I introduction in this post also works in red black tree.
BST(Binary Search Tree) is a widely used data structure, which can reduce the time complex of opration to average \(O(log n)\). Many problem can be efficient solved with BST, e.g. whether an element existed, find the N-th biggest/smallest element, etc. We can implement other data structure with BST, such as set, map.
If you are looking for a simple way to build your personal Blog, Hexo would be a good choice. Hexo has many advantages and the most attractive part for me is that Hexo can generate static website, which means you can easily host your blog on Github with Github-Pages.