Which operation is used to break a preferred path into two sets of parts at a particular node?

Category: QuestionsWhich operation is used to break a preferred path into two sets of parts at a particular node?
Editor">Editor Staff asked 1 month ago

Which operation is used to break a preferred path into two sets of parts at a particular node?
 
(a) Differentiate
 
(b) Cut
 
(c) Integrate
 
(d) Join
 
My doubt stems from Binary Trees in section Binary Trees of Data Structures & Algorithms I
 
The question was posed to me in an interview.

1 Answers
Editor">Editor Staff answered 1 month ago

Correct answer is (b) Cut
 
To explain: A preferred path is broken into two parts. One of them is known as top part while other is known as bottom part. To break a preferred path into two sets, cut operation is used at a particular node.