adplus-dvertising
frame-decoration

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

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)?

Similar Questions

Discover Related MCQs

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

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)

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

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)

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

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

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

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

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

Q. What is a full binary tree?

Q. What is a complete binary tree?

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

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

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

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

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

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

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

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

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