adplus-dvertising
frame-decoration

Question

Select the code snippet which performs post-order traversal. 
a)

public void postorder(Tree root)
{
 System.out.println(root.data);
 postorder(root.left);
 postorder(root.right);
}

b)

public void postorder(Tree root)
{
 postorder(root.left);
 postorder(root.right);
 System.out.println(root.data);
}

c)

public void postorder(Tree root)
{
 System.out.println(root.data);
 postorder(root.right);
 postorder(root.left);
}

d) None of the mentioned

a.

a

b.

b

c.

c

d.

d

Posted under Data Structures and Algorithms

Answer: (a).a

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Select the code snippet which performs post-order traversal.
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!

Java Spring Framework

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

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

Java Programming

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

C Programming

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

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

Big Data Computing

Enhance your understanding of Big Data Computing with our comprehensive MCQs. Explore...

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

Wireless and Mobile Communications

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

Operating System

Dive deep into the core of computers with our Operating System MCQs. Learn about...