Hi, What are the costs of insert() and delete() in ordered_set ets tables? Are they O(log n)? Also, what kind of tree is used to store the keys? Is it a balanced tree (e.g. red-black tree)? Thanks, Yariv