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
checkSum(struct bin-treenode *root , int sum) :
if(root==null)
return sum as 0
else :
leftover_sum=sum-root_node-->value
//missingA. 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: Option A
This Question Belongs to Data Structure >> Binary Search Trees(B Tree)
A. O(1)
B. O(log n)
C. O(n)
D. O(n log n)
Which traversal method of a BST will produce a sorted sequence of node values?
A. Inorder
B. Preorder
C. Postorder
D. Level-order
What is the maximum number of children a node in a Binary Search Tree (BST) can have?
A. 1
B. 2
C. 3
D. Any number
How can you determine if a Binary Tree is a Binary Search Tree (BST)?
A. Verify if all nodes in the left subtree are less than the root and all nodes in the right subtree are greater than the root.
B. Check if the tree is balanced.
C. Ensure all nodes have exactly two children.
D. Verify the height of the tree.
Join The Discussion