if there is binary tree which one is the easiest way to delete all child node?

if there is binary tree which one is the easiest way to
delete all child node?

Question Posted / rahul

1 Answers
5933 Views
Persistent, I also Faced
E-Mail Answers

if there is binary tree which one is the easiest way to delete all child node? ..

class BinaryTreeNode
{
BinaryTreeNode *left,*right;
public:

//....

//....
~BinaryTreeNode()
{
if(left) delete left;
if(right) delete right;
}

};

delete root, all child nodes will be deleted recusively...

Is This Answer Correct ?

11 Yes

5 No

Post New Answer

More C++ General Interview Questions

Difference between pointer to constant and constant pointer to a constant. Give example.

0 Answers HAL,

What is the output of: String a1 = "Hello"; String a2 = "world!"; String* s1 = &a2; String& s2 = a1; s1 = &a1; s2 = a2; std::cout << *s1 << " " << s2 << std::endl;

4 Answers Lehman Brothers,

Write a C/C++ program to show the result of a stored procedure "PROC_RESET_MAIL" on database "USER_NOTIFY".

2 Answers ABC, Accenture, DataLand, HCL, Webyog,

What do you mean by function overriding & function overloading in c++?

0 Answers

Explain what is oop?

0 Answers

Is swift better than c++?

0 Answers

What are function poinetrs? where are they used?

1 Answers CTS,

What is the difference between a shallow copy and a deep copy?