Binary Decision Tree
A rooted, directed tree with two types of vertices, terminal vertices and nonterminal vertices. By merging isomorphic subtrees, we get a Directed Acyclic Graph called a Binary Decision Diagram
Aug 22, 20241 min read
A rooted, directed tree with two types of vertices, terminal vertices and nonterminal vertices. By merging isomorphic subtrees, we get a Directed Acyclic Graph called a Binary Decision Diagram