+1 vote
in Data Structures & Algorithms I by (110k points)
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 Answer

+1 vote
by (672k points)
selected by
Best answer
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.

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.