You can go your entire career without recursing, or using a tree data structure in its raw form (i.e. you only use it as part of a library)
So what tree-traversal/quicksort problems tend to measure is how long it's been since you last did CS class homework problems.