Total Time 20 Minutes Each Question 2 Marks.
Total Ten Questions.
Time limit: 0
Quiz Summary
0 of 10 Questions completed
Questions:
Information
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 must first complete the following:
Results
Quiz complete. Results are being recorded.
Results
0 of 10 Questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 point(s), (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
Categories
- Not categorized 0%
-
If you score less than 16 marks. Please retake the test after a week.
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- Current
- Review
- Answered
- Correct
- Incorrect
-
Question 1 of 10
1. Question
1)A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is
CorrectIncorrect -
Question 2 of 10
2. Question
2) In the balanced binary tree in the below figure,
how many nodes will become unbalanced when a node is inserted as a child of the node “g”?CorrectIncorrect -
Question 3 of 10
3. Question
3) Which of the following sequences denotes the post order traversal sequence of the below tree?
CorrectIncorrect -
Question 4 of 10
4. Question
4) Consider the following nested representation of binary trees: (X Y Z)
indicates Y and Z are the left and right sub stress, respectively, of node X.
Note that Y and Z may be NULL, or further nested. Which of the following represents a valid binary tree?CorrectIncorrect -
Question 5 of 10
5. Question
5) The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16.
What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?CorrectIncorrect -
Question 6 of 10
6. Question
6) Level order traversal of a rooted tree can be done by starting from the root and performing
CorrectIncorrect -
Question 7 of 10
7. Question
7) The height of a binary tree is the maximum number of edges in any root to leaf path.
The maximum number of nodes in a binary tree of height h is:
[^ denote exponent]CorrectIncorrect -
Question 8 of 10
8. Question
8) The maximum number of binary trees that can be formed with three unlabeled nodes is:
CorrectIncorrect -
Question 9 of 10
9. Question
9) Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:
Note: The height of a tree with a single node is 0.CorrectIncorrect -
Question 10 of 10
10. Question
10) Postorder traversal of a given binary search tree T produces the following sequence of keys 10, 9, 23, 22, 27, 25, 15, 50, 95, 60, 40, 29
Which one of the following sequences of keys can be the result of an inorder traversal of the tree T?CorrectIncorrect