introduction AVL Tree named after its inventor Adelson-Velskii and Landis is a sort of binary search tree. There is a balance factor -1,0,1 which...
introduction There are three sort algorithms with regard to tree topology. They are: tree search sort tree select sort (alias competitors sort) heap...
introduction As who have studied data structure knows, hashing is best fast way to look up a data. The cost of it is just some spaces. The time...
introduction As everyone knows, Quick Sort is an excellent algorithm with average time complexity of \(O(n\cdot log(n))\)。Merge Sort is also a...
introduction The traditional ways to implement heap are to use arrays! As we all know, the length of array is fixed. Since that, the usage of heap...
Code def object2Map(obj:object): """covert object to dict""" m = obj.__dict__ for k in m.keys(): v = m[k] if hasattr(v,...