Decision tree algorithm?explain in process and importnace
Answers
Answered by
1
hey dear
Incomputer science, atreeis a widely usedabstract data type(ADT)—ordata structureimplementing this ADT—that simulates a hierarchicaltree structure, with a root value andsubtreesof children with a parent node, represented as a set of linkednodes.A tree data structure can be definedrecursively(locally) as a collection ofnodes(starting at a root node), where each node is a data structure consisting of a value, together with a list of references to nodes (the "children"), with the constraints that no reference is duplicated, and none points to the root.Alternatively, a tree can be defined abstractly as awhole (globally) as anordered tree, with a value assigned to each node. Both these perspectives are useful: while a tree can be analyzed mathematically as a whole, when actually represented as a data structure it is usually represented and worked with separately by node (rather than as a set of nodes and anadjacency listof edges between nodes, as one may represent adigraph, for instance). For example, looking at a tree as a whole, one can talk about"the parent node" of a given node, but in general as a data structure a given node only contains thelist of its children, but does not contain a reference to its parent (if any).
Incomputer science, atreeis a widely usedabstract data type(ADT)—ordata structureimplementing this ADT—that simulates a hierarchicaltree structure, with a root value andsubtreesof children with a parent node, represented as a set of linkednodes.A tree data structure can be definedrecursively(locally) as a collection ofnodes(starting at a root node), where each node is a data structure consisting of a value, together with a list of references to nodes (the "children"), with the constraints that no reference is duplicated, and none points to the root.Alternatively, a tree can be defined abstractly as awhole (globally) as anordered tree, with a value assigned to each node. Both these perspectives are useful: while a tree can be analyzed mathematically as a whole, when actually represented as a data structure it is usually represented and worked with separately by node (rather than as a set of nodes and anadjacency listof edges between nodes, as one may represent adigraph, for instance). For example, looking at a tree as a whole, one can talk about"the parent node" of a given node, but in general as a data structure a given node only contains thelist of its children, but does not contain a reference to its parent (if any).
Similar questions