Can you provide some references to open source implementations of Succinct implicit trees ? How different are they from a simple unbalanced BST ?