Question
a.
0
b.
8
c.
16
d.
4
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. The number of nodes that have no successors in a complete binary tree of depth 4 is
Similar Questions
Discover Related MCQs
Q. One can make an exact replica of a Binary Search Tree by traversing it in ...............
View solution
Q. A complete Binary Tree with 15 nodes contains ................. edges.
View solution
Q. Visiting root node after visiting left and right sub-trees is called .............
View solution
Q. A complete binary tree with the property that the value of each node is at least as large as the values of its children is known as ..............
View solution
Q. A tree in which, for every node, the difference between the height of its left subtree and right subtree is not more than one is
View solution
Q. A binary tree stored using linked representation can be converted to its mirror image by traversing it in ...............
View solution
Q. The balance factor for an AVL tree is either
View solution
Q. AVL trees have LL, LR, RR, RL rotations to balance the tree to maintain the balance factor (LR : Insert node in Right sub tree of Left sub tree of node A, etc). Among rotations the following are single and double rotations
View solution
Q. Heap is an example of ................
View solution
Q. The number of unused pointers in a complete binary tree of depth 5 is:
View solution
Q. The running time for creating a heap of size n is .............
View solution
Q. One can determine whether a Binary tree is a Binary Search Tree by traversing it in ................
View solution
Q. The maximum number of nodes in a binary tree of depth 5 is ...............
View solution
Q. In a min-heap:
View solution
Q. A complete binary tree with n leaf nodes has ..............
View solution
Q. A binary tree can be converted in to its mirror image by traversing it in ..............
View solution
Q. Which one of the following statements is false?
View solution
Q. A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers?
View solution
Q. Which of the following need not to be a binary tree ?
View solution
Q. Which of the following statements is false ?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!