Data structure Interview Questions and Answers

Related Subjects

All Subject

C Interview Questions and Answers | CPlusPlus Interview Questions and Answers | Java Interview Questions and Answers | Web Design Interview Questions and Answers | DotNet Interview Questions and Answers | PHP Interview Questions and Answers | Java Script Interview Questions and Answers | Database Interview Questions and Answers | Perl Interview Questions and Answers | Unix Interview Questions and Answers | Visual Basic 6 Interview Questions and Answers | Hardware Interview Questions and Answers | XML Interview Questions and Answers | ASP Interview Questions and Answers | Networking Interview Questions and Answers | Quality Interview Questions and Answers | SAP Interview Questions and Answers | Sharepoint Interview Questions and Answers | OOP Interview Questions and Answers | Peoplesoft Interview Questions and Answers | Biztalk Interview Questions and Answers | PYTHON Interview Questions and Answers | Animation Interview Questions and Answers | Ruby Interview Questions and Answers | Regular Expressions Interview Questions and Answers | Automata Interview Questions and Answers

Question - Write the recursive C function to count the number of nodes present in a binary tree.

Answer -

int count (struct node* t)

{

if(t)

{

int l, r;

l = count(t->left);

r=count(t->right);

return (1+l+r);

}

else

{

return 0;

}

}

Comment(S)

Show all Coment

Leave a Comment

|

NCERT Solutions

Share your email for latest updates

Name:

Email:

Latest News

10000+ interview questions in different categories

Freshers and experienced

Testimonial

NCERT Questions Answers

We are group of professionals with the same objective for helping school students who are struggling in NCERT Questions Answers. We are just sharing our knowledge for the students and helping them by providing Questions Answers.

Halpura.com

At Halpura we are reimagining the actual potentials of quality information resources reaching people across the globe to make an everlasting impact.

Our partners