Machine Learning MCQ - Type of nodes in a decision tree

Multiple choices questions in Machine learning. Interview questions on machine learning, quiz questions for data scientist answers explained, decision tree, types of nodes, root, decision node, leaft node, how many incoming edges are there in an internal node?

Machine Learning MCQ - Types of nodes in a decision tree

< Previous

Next >

 

1. What are different types of nodes a decision tree has?

a) Root node

b) Internal nodes

c) Leaf nodes

d) All of the above

Answer: (d) All of the above A decision tree has all the three nodes. Root node – node with NO incoming edges and ZERO or more outgoing edges. It contains attribute test conditions to separate records. Internal nodes – nodes with exactly ONE incoming edge and ZERO or more outgoing edges. Internal nodes contain attribute test conditions to separate records. Leaf (terminal) nodes – nodes with exactly ONE incoming edge with NO outgoing edges. Leaf nodes have class labels.   Decision tree nodes - an example

 

 

< Previous

Next >

 

************************

Related links:

• Machine learning MCQ home page

• Machine learning TRUE / FALSE questions home page

• Computer science engineering quiz questions and answers page

• Data Warehousing and Data Mining MCQ with answers home
  

Type of nodes in a decision tree

Which is a decision node?

Can we have labels in internal nodes in a decision tree?

Machine learning solved mcq, machine learning solved mcq