The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we help you to solve your academic and programming questions fast.
In eduladder you can Ask,Answer,Listen,Earn and Download Questions and Question papers.
Watch related videos of your favorite subject.
Connect with students from different parts of the world.
Apply or Post Jobs, Courses ,Internships and Volunteering opportunity. For FREE
See Our team
Wondering how we keep quality?
Got unsolved questions? Ask Questions

Gate-Computer-Science-Engineering-question-paper-2014-->View question

Consider the pseudocode given below. The function Dosomething () takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode. - Gate Computer Sci

typedef struct treeNode* treeptr;
Struct treeNode
Treeptr leftMostchild, rightSibiling;
Int Dosomething (treeptr tree)
int value =0;
if (tree ! = NULL) {
If (tree -> leftMostchild = = NULL)
value = Dosomething (tree->leftMostchild);
value = value + Dosometing (tree->rightsibiling);
return (value);
When the pointer to the root of a tree is passed as the argument to DoSomething, the value returned by the function corresponds to the
(A) number of internal nodes in the tree.
(B) height of the tree.
(C) number of nodes without a right sibling in the tree.
(D) number of leaf nodes in the tree.

Asked On2017-07-03 06:32:57 by:Aparna-Dasgupta

Taged users:

Be first to like this question

Be first to dislike this question
Talk about this  Like  Dislike
View all qusetions

Number of leaf nodes in the tree

The key to solving such questions is to understand or detect where/by what condition the value (or the counter) is getting incremented each time. 

 Here, that condition is if (tree→leftMostchild == Null) 

⇒ Which means if there is no left most child of the tree (or the sub-tree or the current nodeas called in recursion) 

⇒ Which means there is no child to that particular node (since if there is no left most child, there is no child at all). 

⇒ Which means the node under consideration is a leaf node.

⇒ The function recursively counts, and adds to value, whenever a leaf node is encountered. 

⇒ The function returns the number of leaf nodes in the tree.  

Answerd on:2017-07-04 Answerd By:tarun101

Be first to like this answer

Be first to dislike this answer
Talk about this  Like  Dislike

You might like this video:Watch more here

Watch more videos from this user Here

Learn how to upload a video over here

Lets together make the web is a better place

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.
Answer a question: You can answer the questions not yet answered in eduladder.How to answer a question
Career: Work or do your internship with us.Work with us
Create a video: You can teach anything and everything each video should be less than five minutes should cover the idea less than five min.How to upload a video on eduladder