##
ScapeGoat Tree | Set 1 (Introduction and Insertion)
February 13, 2017

A ScapeGoat tree is a self-balancing Binary Search Tree like AVL Tree, Red-Black Tree, Splay Tree, ..etc. Search time is O(Log n) in worst case. Time taken by deletion and insertion is amortized O(Log n) The balancing idea is to make sure that nodes are α size balanced. Α size balanced means sizes of left… Read More »