Question d’entretien chez MathWorks
Difference between a directed acyclic graph and binary search tree?
Réponse à la question d'entretien
Utilisateur anonyme
15 juin 2020
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