CS301 Data Structure Quizzes File No 35

Question # 1
A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a Link) ___________Successor.
Preorder
Inorder
Postorder
Leveloder

Question # 2
Which of the following is a property of binary tree?
A Binary tree with N internal nodes has 2+N links, N-1 links to internal nodes and N+1 links to external nodes
A Binary tree with N internal nodes has 2*N links, N-1 links to internal nodes and N+1 links to external nodes.
A Binary tree with N internal nodes has 2-N links, N-1 links to internal nodes and N+1 links to external nodes.
A Binary tree with N internal nodes has 2N links, N+1 links to internal nodes and N-1 links to external nodes.

Question # 3
A Threaded Binary tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link)_____________ successor.
Preoder
Inorder
Postorder
Levelorder


Question # 4
If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?
54
55
56
57


Question # 5
Which of the following statement is correct?
A threaded Binary tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor.
A threaded Binary tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREORDER successor.
A threaded Binary tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor.
A threaded Binary tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its POSTORDER predecessor.


Question # 6
It is necessary fro Huffman encoding tree to be,
AVL tree
Binary tree
Complete binary Tree
None of these


Question # 7
A binary tree with 45 internal nodes has _________ links to external nodes.
44
45
46
90


Question # 8
In which of the following tree, parent nodes has key greater than or equal to its both children?
Max heap
Binary search tree
Threaded Binary tree
Complete Binary tree


Question # 9
If one pointer of the nodes in a binary tree is NULL then it will be a/an
Inner node
Leaf node
External node
Root node


Question # 10
If there are N external nodes is a binary tree then what will be the no. of the internal nodes in this binary tree?
N-1
N
N+1
N+2


Question # 11
See the below code and fill the appropriate answer for? Void fastlnorder(TreeNod+p) {while((p+nextInorder(p)) !+ ? ) cout p->getInfo();}
Dummy
rootNode
LTH
RTH


Question # 12
In threaded binary tree, the NULL pointer are replaced by the. Preorder successor or Predecessor
Inorder successor or predecessor
Postorder successor or predecessor
NULL pointer are not replaced


Question # 13
In which of the following tree, parent nodes has a key greater than or equal to its both children?
Max heap
Binary search tree
Threaded Binary three
Complete Binary tree


Question # 14
In Complete binary tree the bottom level is filled from _______.
Left to right
Right to left
Not filled at all
None of the given options


Question # 15
If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a ________
Complete Binary tree
Threaded Binary Tree
Expression tree
Perfectly compete Binary tree


Question # 16
If an expression tree is correct then its root should have,
An operator
(
)
an operand

In threaded binary tree, the NULL pointers are replaced by the.
Preorder successor or predecessor
Inorder successor or predecessor
Postorder successor or predecessor
NULL pointer are not replaced


Question # 17
A complete binary tree is a tree that is ________ filled, with the possible exception of the bottom level.
Partially
Completely
Incompletely
Partly


Question # 18
If the bottom level of a binary tree is not completely filled, depicts that the tree is not a _________.
Expression tree
Threaded binary tree
Complete binary tree
Perfectly complete binary tree


Question # 19
An expression tree will always be a,
Complete binary tree
Binary search tree
Heap AVL tree


Question # 20
Which of the following is a property of binary tree?
A binary tree of N external nodes has N internal node
A Binary tree of N internal nodes has N+1 external node
A Binary tree of N external nodes has N+1 internal node
A Binary tree of N internal has N-1 external node


Question # 21
In a threaded binary tree which nodes have NULL child pointers,
All leaf nodes
Nodes other then leaf nodes
Root Node
None of the nodes
           

Question # 22
In threaded binary tree, the NULL pointers are replaced by the
preorder successor or predecessor
inorder successor or predecessor
postorder successor or predecessor
NULL pointers are not replaced


Question # 23
A complete binary tree is a tree that is _______ filled, with the possible exception of the bottom level.
partially
completely
incompletely
partly


Question # 24
Which one of the following is TRUE about iteration?
Iterative function calls consumes a lot of memory
Threaded Binary Trees use the concept of iteration
Iteration extensively uses stack memory
Recursion is more efficient than iteration


Question # 25
We implement the heap by ____________ .
Threaded Tree
AVL tree
Complete binary tree
Expression


Question # 26
Which of the following statement concerning heaps is NOT true?
Traversing a heap in order provides access to the data in numeric or alphabetical order.
Removing the item at the top provides immediate access to the key value with highest (or lowest) priority.
Inserting an item is always done at the end of the array, but requires maintaining the heap property.
A heap may be stored in an array.


Question # 27
Which of the following statement concerning heaps is NOT true?
A heap can be stored in a binary search tree.
A heap can be stored in an array.
A heap can be used to implement a priority queue.
A heap can be used to sort data.


Question # 28
A complete binary tree is a tree that is _________ filled, with the possible exception of the bottom level.
partially
completely
incompletely
partly


Question # 29
By using __________we avoid the recursive method of traversing a Tree, which makes use of stacks and consumes a lot of memory and time. Binary tree only
Heap data structure
Huffman encoding


Question # 30
Which of the following statement is true about dummy node of threaded binary tree?
The left pointer of dummy node points to the itself while the right pointer points to the root of tree.
The left pointer of dummy node points to the root node of the tree while the right pointer points itself i.e. to dummy node.
The left pointer of dummy node points to the root node of the tree while the right pointer is always NULL.
The right pointer of dummy node points to the itself while the left pointer is always NULL.
Threaded binary tree

Question # 31
When a complete binary tree, represented by an array then for any array element at position i, the parent is at position ______ .
2i-1
2i
2i+1
floor(i/2) 


Question # 32
When a complete binary tree represented by an array then if right child is at position 5 then left child will be at position _____
2
3
4
6


Question # 33
A binary tree with N internal nodes has _____ links, _______ links to internal nodes and ________ links to external nodes.
2N, N-1, N+1 N-1, 2N, N+1
N+1, 2N, N-1
N+1, N-1, 2N


Question # 34
If a binary tree has N + 1 external nodes then,
It has N internal nodes.
It has N-1 internal nodes.
It has N/2 internal nodes.
It has N+2 internal nodes.


Question # 35
A binary tree with 45 internal nodes has _______links to external nodes.
44
45
46
90


Question # 36
Consider a binary tree, represented by the following array: 10,7,9,5,2,1,6,3,4 This is a ________.
Min heap
Max heap (Not Sure)
Threaded binary tree
Binary Search tree


Question # 37
 Consider a binary tree, represented by the following array: A,B,C,D,E,F,G,I Is it a strictly binary tree ?  
Yes
No


Question # 38
In threaded binary tree the NULL pointers are replaced by the
preorder successor or predecessor
inorder successor or predecessor
inorder successor or predecessor
NULL pointers are not replaced


Question # .39
Consider a binary tree, represented by the following array: A,B,C,D,E,F,G,H,I,J,K,L Is it a strictly binary tree?
Yes
No 


Question # 40
We implement the heap by ______________ .
Threaded Tree
AVL tree
Complete binary tree
Expression


Question # 41
If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?
      
       ► 54
       ► 55
       ► 56
       ► 57


Question # 42
Which of the following statements is correct property of binary trees? 
    
       ► A binary tree with N internal nodes has N+1 internal links.
       ► A binary tree with N external nodes has 2N internal nodes.
       ► A binary tree with N internal nodes has N+1 external nodes. 
       ► None of above statement is a property of the binary tree. 


Question # 43
Which of the following is a property of binary tree?
       ► A binary tree of N external nodes has N internal node.
       ► A binary tree of N internal nodes has N+ 1 external node.
       ► A binary tree of N external nodes has N+ 1 internal node.
       ► A binary tree of N internal nodes has N- 1 external node.


Question # 44
Which of the following statement is true about dummy node of threaded binary tree?
       ► The left pointer of dummy node points to the itself while the right pointer points to the root of tree.
       ► The left pointer of dummy node points to the root node of the tree while the right pointer points itself i.e. to dummynode
       ► The left pointer of dummy node points to the root node of the tree while the right pointer is always NULL.
       ► The right pointer of dummy node points to the itself while the left pointer is always NULL.


Question # 45
If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a    
       ► Expression tree
       ► Threaded binary tree
       ► complete Binary tree
       ► Perfectly complete Binary tree


Question # 46
 Which of the following statement is correct about find(x) operation: 
       ► A find(x) on element x is performed by returning exactly the same node that is found.
       ►  A find(x) on element x is performed by returning the root of the tree containing x.
       ►  A find(x) on element x is performed by returning the whole tree itself containing x.
       ► A find(x) on element x is performed by returning TRUE.


Question # 47
If there are 23 external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?
       ► 23
       ► 2
       ► 21
       ► 22


Question # 48
f there are N external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?
       ► N -1
       ► N+1
       ► N+2
       ► N


Question # 49
Which of the following statement is correct?
       ► A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER
successor.
       ► A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREOREDR successor.
       ► A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its INORDER successor.
       ► A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its POSTORDER successor.
 

Question # 50
By using __________we avoid the recursive method of traversing a Tree, which makes use of stacks and consumes a lot of memory and time.
       ► Binary tree only
       ► Threaded binary tree
       ► Heap data structure
       ► Huffman encoding


Question # 51
Consider a min heap, represented by the following array:
10,30,20,70,40,50,80,60
After inserting a node with value 31.Which of the following is the updated min heap?
       ► 10,30,20,31,40,50,80,60,70      
       ► 10,30,20,70,40,50,80,60,31
       ► 10,31,20,30,40,50,80,60,31
       ► 31,10,30,20,70,40,50,80,60


Question # 52
In complete binary tree the bottom level is filled from ________.
       ► Left to right
       ► Right to left
       ► Not filled at all
       ► None of the given options


Question # 53
In case of deleting a node from AVL tree, rotation could be prolong to the root node.
       ► Yes
       ► No


Question # 54
When an array of object is created dynamically then there is no way to provide parameterized constructors for array of objects. True
Flase


Question # 55
Which of the following method is helpful in creating the heap at once?
Insert
add
update
preculateDown