Is there an O(logN) optimal weight balanced binary search tree where weights/sizes of left and right subtree differ at most by 1?
Refer the following paper; https://www.researchgate.net/publication/2241064_A_New_Weight_Balanced_Binary_Search_Tree.
It has both bottom-up and top-down restructuring.