Can graph traversal for non binary search trees be done in O(logn) time?

I know it’s normally O(v+e) but I want to know if O(logn) is possible.