A binary search tree can fall under the category of a directed acyclic graph, but the opposite is not the case. Tree nodes can only have one parent whereas DAG nodes/vertices can have more than one incoming edge