+1 vote
in Data Structures & Algorithms I by (88.2k points)
Reducing search space by eliminating irrelevant trees is known as?

(a) pruning

(b) partial results

(c) freeing space

(d) traversing

Enquiry is from Trees topic in chapter Trees of Data Structures & Algorithms I

This question was posed to me during an online exam.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct answer is (a) pruning

The best explanation: Pruning is eliminating irrelevant trees. Partial results are keeping best results and updating. Traversal is visiting all the nodes of a tree.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.