Reducing search space by eliminating irrelevant trees is known as?

Category: QuestionsReducing search space by eliminating irrelevant trees is known as?
Editor">Editor Staff asked 1 month ago

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 Answers
Editor">Editor Staff answered 1 month ago

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.