Is there an O(logN) optimal weight balanced binary search tree where weights/sizes of left and right subtree differ at most by 1? I am wondering if there is a log time WBT (weight balanced binary search tree) data structure in which for any node, the sizes of its left and right subtrees diff at most by 1.

PS: I have read through Balancing weight-balanced trees but the weights of subtrees can differ up to a factor of $\Delta$.
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.