adplus-dvertising
frame-decoration

Question

What is the code below trying to print? 
void print(tree *root,tree *node)
{
  if(root ==null) return 0
  if(root-->left==node || root-->right==node || print(root->left,node)||printf(root->right,node)
  {
     print(root->data)
  }
}

a.

print(root->data)
}
}
a) just printing all nodes

b.

not a valid logic to do any task

c.

printing ancestors of a node passed as argument

d.

printing nodes from leaf node to a node passed as argument

Posted under Data Structures and Algorithms

Answer: (c).printing ancestors of a node passed as argument

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the code below trying to print?
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!

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Computer Architecture

Unveil the science behind computer design with our Computer Architecture MCQs. Topics...

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...

Software Engineering

Learn about the systematic approach to developing software with our Software...

CompTIA PenTest+ Certification Exam PT0 002

Prepare for the CompTIA PenTest+ PT0-002 exam with our targeted MCQs. Covering...