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

Q. Which of the following remarks about Tree- indexing are true?

View solution

Q. 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

View solution

Q. 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

View solution

Q. Traversing a binary tree first root and then left and right subtrees called _______traversal.

View solution

Q. A binary tree having n nodes and depth d will be about complete binary tree if

View solution

Q. Which of the following statements is/are correct ?

View solution

Q. A binary tree of depth "d" is an almost complete binary tree if

View solution

Q. If each node in a tree has value greater the every value in its left subtree and has value less than every value in its right subtree, the tree is called

View solution

Q. The number of nodes in a complete binary tree of level 5 is

View solution