Which traversal should be used to print nodes at k’th level of a binary tree where k is much less than total number of levels?

Question

I don\'t know if traversal in this case matters because all traversal needs O(n) time so why prefer one over another. Please contradict me with a valid explanation.
Re