Both a sorted array and a binary tree can let you look up an element in log(N) time. However I would expect a sorted array to be faster in practice because of the constant factor. However ...

Merkle trees vs. Verkle trees, Explained What are Merkle trees and how do they work? A binary tree that uses cryptographic hash algorithms is called a Merkle tree.

To compensate these downsides, Tarreau designed an Elastic Binary tree (EBtree) data structure. The EBtree is optimized for frequent inserts and deletes without additional memory management.