+1 vote
in Data Structures & Algorithms I by (88.2k points)
An expression tree’s nodes can be deleted by calling?

(a) malloc

(b) calloc

(c) delete

(d) free

Origin of the question is Trees topic in division Trees of Data Structures & Algorithms I

I have been asked this question in examination.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right answer is (d) free

Easiest explanation - In Binary trees, nodes are created by calling malloc and they are deleted by calling free.

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.