- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
Data Structures | Tree Traversals | Question 4
Last Updated :
Discuss
Comments
What does the following function do for a given binary tree?
C
int fun(struct node *root)
{
if (root == NULL)
return 0;
if (root->left == NULL && root->right == NULL)
return 0;
return 1 + fun(root->left) + fun(root->right);
}
Counts leaf nodes
Counts internal nodes
Returns height where height is defined as number of edges on the path from root to deepest node
Return diameter where diameter is number of edges on the longest path between any two nodes.
This question is part of this quiz :
Top MCQs on Tree Traversal with Interview Question and Answers | DSA QuizTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy