The following statement is considered true:
In a DAG, for every vertex $v$, there exists a sink $s$ such that there is a path from $v$ to $s$.
However, my counter example to this is a binary search tree. The leaf nodes in a binary tree do not have a path from themselves to a sink. Hence, am I interpreting this statement incorrectly?