Binary tree to get minimum element in O(1)

Posted by Rudiger on Stack Overflow See other posts from Stack Overflow or by Rudiger
Published on 2010-02-14T16:02:03Z Indexed on 2010/03/30 22:03 UTC
Read the original article Hit count: 512

I'm accessing the minimum element of a binary tree lots of times. What implementations allow me to access the minimum element in constant time, rather than O(log n)?

© Stack Overflow or respective owner

Related posts about data-structures

Related posts about binary-trees