Question

What is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)?

checkSum(struct bin-treenode *root , int sum) :
  if(root==null)
    return sum as 0
  else :
     leftover_sum=sum-root_node-->value
     //missing

a.

code for having recursive calls to either only left tree or right trees or to both subtrees depending on their existence

b.

code for having recursive calls to either only left tree or right trees

c.

code for having recursive calls to either only left tree

d.

code for having recursive calls to either only right trees

Posted under Data Structures and Algorithms

Answer: (a).code for having recursive calls to either only left tree or right trees or to both subtrees depending on their existence

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)?

Add Comment

Similar Questions

Discover Related MCQs

Q. What is the time complexity of pre-order traversal in the iterative fashion?

View solution

Q. What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)

View solution

Q. To obtain a prefix expression, which of the tree traversals is used?

View solution

Q. What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)

View solution

Q. What is the time complexity of level order traversal?

View solution

Q. Which of the following graph traversals closely imitates level order traversal of a binary tree?

View solution

Q. In a binary search tree, which of the following traversals would print the numbers in the ascending order?

View solution

Q. The number of edges from the root to the node is called __________ of the tree.

View solution

Q. The number of edges from the node to the deepest leaf is called _________ of the tree.

View solution

Q. What is a full binary tree?

View solution

Q. What is a complete binary tree?

View solution

Q. What is the time complexity for finding the height of the binary tree?

View solution

Q. Which of the following is not an advantage of trees?

View solution

Q. In a full binary tree if number of internal nodes is I, then number of leaves L are?

View solution

Q. In a full binary tree if number of internal nodes is I, then number of nodes N are?

View solution

Q. In a full binary tree if there are L leaves, then total number of nodes N are?

View solution

Q. Which of the following is correct with respect to binary trees?

View solution

Q. Which of the following is false about a binary search tree?

View solution

Q. What is the speciality about the inorder traversal of a binary search tree?

View solution

Q. What are the worst case and average case complexities of a binary search tree?

View solution

View All MCQs on Data Structures and Algorithms

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...

MySQL Database

Enhance your knowledge of relational databases with our MySQL MCQs. Understand...

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...

Computer Hardware

Explore the tangible components of computers with our Computer Hardware MCQs. Learn...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...