Before revision:  Given a tree with n nodes, we show how to represent the corresponding collection in O(n) space and optimal O(\log n/ \log \log n) query time.
After revision:  Given a tree with n nodes, we show how to represent the corresponding collection in O(n) space and O(\log n/ \log \log n) query time.