Trees in C
Quiz Summary
0 of 20 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
Results
0 of 20 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%
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- Current
- Review
- Answered
- Correct
- Incorrect
- Question 1 of 20
1. Question
1. Which of the following statement about binary tree is correct?
CorrectIncorrect - Question 2 of 20
2. Question
2. Suppose we have numbers between 1 and 1000 in a binary search tree and want to search for the number 363. Which of the following sequence could not be the sequence of the node examined?
CorrectIncorrect - Question 3 of 20
3. Question
3. In full binary search tree every internal node has exactly two children. If there are 100 leaf nodes in the tree, how many internal nodes are there in the tree?
CorrectIncorrect - Question 4 of 20
4. Question
4. Which type of traversal of binary search tree outputs the value in sorted order?
CorrectIncorrect - Question 5 of 20
5. Question
5. If a node having two children is to be deleted from binary search tree, it is replaced by its
CorrectIncorrect - Question 6 of 20
6. Question
6. A binary search tree is formed from the sequence 6, 9, 1, 2, 7, 14, 12, 3, 8, 18. The minimum number of nodes required to be added in to this tree to form an extended binary tree is?
CorrectIncorrect - Question 7 of 20
7. Question
7. When a binary tree is converted in to an extended binary tree, all the nodes of a binary tree in the external node becomes
CorrectIncorrect - Question 8 of 20
8. Question
8. A threaded binary tree is a binary tree in which every node that does not have right child has a thread to its
CorrectIncorrect - Question 9 of 20
9. Question
9. A binary search tree is generated by inserting in order the following integers:
50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24The number of the node in the left sub-tree and right sub-tree of the root, respectively, is
CorrectIncorrect - Question 10 of 20
10. Question
10. A Binary Tree can have
CorrectIncorrect - Question 11 of 20
11. Question
11. Height of a binary tree is
CorrectIncorrect - Question 12 of 20
12. Question
12. True statements about AVL tree are
CorrectIncorrect - Question 13 of 20
13. Question
13. Match the following for binary tree traversal
Sort elements
- Root Left Right
- Left Root Right
- Left Right Root
- (1) Pre Order
- (2) In Order
- Post Order
CorrectIncorrect - Question 14 of 20
14. Question
14. Given a binary search tree, which traversal type would print the values in the nodes in sorted order?
CorrectIncorrect - Question 15 of 20
15. Question
15. Which of the following statements about binary trees is NOT true?
CorrectIncorrect - Question 16 of 20
16. Question
16. 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 called
CorrectIncorrect - Question 17 of 20
17. Question
17. A complete binary tree with the property that the value at each node is at least as large as the values at its children is called
CorrectIncorrect - Question 18 of 20
18. Question
18. A 3-ary tree in which every internal node has exactly 3 children. The number of leaf nodes in such a tree with 6 internal nodes will be
CorrectIncorrect - Question 19 of 20
19. Question
19. A complete binary tree of level 5 has how many nodes ?
CorrectIncorrect - Question 20 of 20
20. Question
20. Traversing a binary tree first root and then left and right subtrees called _______traversal.
CorrectIncorrect