Binary Trees Programming Quiz and Test – Update your knowledge on Binary trees.
Core Java Quiz : J2SE Smart Quiz
0 of 10 questions completed
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:
0 of 10 questions answered correctly
Time has elapsed
You have reached 0 of 0 points, (0)
- Question 1 of 10
1. Question1 points
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 in-order traversal of the tree T? (GATE CS 2005)
- Question 2 of 10
2. Question1 points
The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is:
- Question 3 of 10
3. Question1 points
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are
- Question 4 of 10
4. Question1 points
Consider a complete binary tree where the left and the right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is
- Question 5 of 10
5. Question1 points
Consider a node X in a Binary Tree. Given that X has two children, let Y be Inorder successor of X. Which of the following is true about Y?
- Question 6 of 10
6. Question1 points
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:
- Question 7 of 10
7. Question1 points
In a complete k-ary tree, every internal node has exactly k children or no child. The number of leaves in such a tree with n internal nodes is:
- Question 8 of 10
8. Question1 points
A binary tree can easily be converted into q 2-tree
- Question 9 of 10
9. Question1 points
The depth of a complete binary tree is given by
- Question 10 of 10
10. Question1 points
In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called