In this blog post “Balanced Binary Search Tree“, I introduce two balanced binary search trees, which are AVLTree and RedBlackTree. AVLTree is efficient for search. Its time complexity is O(logN) for search, insertion and deletion. It usually takes one top-down… Read More
balanced binary search tree
Recently I am reading books about trees, which are data structures that can be used to stored data elements. Among various types of trees, balanced binary search tree (I will use BBST for short in this post) is a notable… Read More