Trees
Quizsummary
0 of 11 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
Information
Basic Questions on tree data structure.
You must specify a text. 

You must specify an email address. 
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 11 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0)
Categories
 Not categorized 0%
 Trees 0%
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 Answered
 Review

Question 1 of 11
1. Question
1 pointsA binary tree stored using linked representation can be converted to its mirror image by traversing it in
Correct
Incorrect

Question 2 of 11
2. Question
1 pointsThe depth dn, of complete binary tree of n nodes, where nodes are labeled from 1 to n with root as node 1 and last leaf node as node n is
Correct
Incorrect

Question 3 of 11
3. Question
1 pointsThe balancing factor for an AVL tree is either
Correct
Incorrect

Question 4 of 11
4. Question
1 pointsThe number of unused pointers in a complete binary tree of depth 5 is
Correct
Incorrect

Question 5 of 11
5. Question
1 pointsThe running time for creating a heap of size n is
Correct
Incorrect

Question 6 of 11
6. Question
1 pointsThe maximum number of nodes in a binary tree of depth 5 is
Correct
Incorrect

Question 7 of 11
7. Question
1 pointsIn ______, the difference between the height of the left sub tree and height of the right tree, for each node, is almost one.
Correct
Incorrect

Question 8 of 11
8. Question
1 pointsA full binary tree with ‘n’ nonleaf nodes contains
Correct
Incorrect

Question 9 of 11
9. Question
1 pointsAVL trees have LL, LR, RR, RL rotations to balance the tree to maintain the balancing factor (LR : Insert node in Right sub tree of Left sub tree of node A, etc). Among the following rotations which are single and double rotations respectively?
Correct
Incorrect

Question 10 of 11
10. Question
1 pointsA complete binary tree with n leaf nodes has
Correct
Incorrect

Question 11 of 11
11. Question
1 pointsA sorting technique which uses the binary tree concept such that label of any node is larger than all the labels in the subtrees, is called
Correct
Incorrect