An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times