Tree Traversals
Quizsummary
0 of 10 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
Information
treetraversals
You must specify a text. 

You must specify a text. 

You must specify a number. 
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Results
0 of 10 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0)
Categories
 Not categorized 0%
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 Answered
 Review

Question 1 of 10
1. Question
What is common in three different types of traversals (Inorder, Preorder and Postorder)?
Correct
Incorrect

Question 2 of 10
2. Question
What does the following function do for a given binary tree?
int fun(struct node *root)
{
if (root == NULL)
return 0;
if (root>left == NULL && root>right == NULL)
return 0;
return 1 + fun(root>left) + fun(root>right);
}Correct
Incorrect

Question 3 of 10
3. Question
Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder traversal. Respectively, of a complete binary tree. Which of the following is always true? (GATE CS 2000)
Correct
Incorrect

Question 4 of 10
4. Question
Level order traversal of a rooted tree can be done by starting from the root and performing
Correct
Incorrect

Question 5 of 10
5. Question
A binary tree in which if all its levels except possibly the last, have the maximum number of
nodes and all the nodes at the last level appear as far left as possible, is known asCorrect
Incorrect

Question 6 of 10
6. Question
A full binary tree with n leaves contains
Correct
Incorrect

Question 7 of 10
7. Question
One can convert a binary tree into its mirror image by traversing it in
Correct
Incorrect

Question 8 of 10
8. Question
A BST is traversed in the following order recursively: Right, root, left
The output sequence will be inCorrect
Incorrect

Question 9 of 10
9. Question
Time complexities of three algorithms are given. Which should execute the slowest for large
values of N?Correct
Incorrect

Question 10 of 10
10. Question
A full binary tree with 2n+1 nodes contain
Correct
Incorrect