Your idea appears to build upon the concepts in the https://en.wikipedia.org/wiki/Hashed_array_tree https://en.wikipedia.org/wiki/Hashed_array_tree . Alternati

Your idea appears to build upon the concepts in the https://en.wikipedia.org/wiki/Hashed_array_tree https://en.wikipedia.org/wiki/Hashed_array_tree . Alternatively, here's my list ADT implementation which has O(log n) access/insertion/deletion time: https://www.nayuki.io/page/avl-tree-list https://www.nayuki.io/page/avl-tree-list .