adplus-dvertising
frame-decoration

Question

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

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

b)

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

c)

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

d) None of the mentioned

a.

a

b.

b

c.

c

d.

d

Answer: (b).b

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 in-order traversal.

Similar Questions

Discover Related MCQs

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?

Q. What are the conditions for an optimal binary search tree and what is its advantage?

Q. What is an AVL tree?

Q. Why we need to a binary tree which is height balanced?