The degree of a vertices is the number of _______ to that vertex.
a) Edges b) Cycles c) Both a and b d) None of these
A binary tree whose every node has either zero or two children is called
a) Complete binary tree b) Binary search tree c) Extended binary tree d) None of above
Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?
a) Yes just traverse through the array and form the tree b) No we need one more traversal to form a tree c) No in case of sparse trees d) None of the mentioned
What is the maximum possible number of nodes in a binary tree at level 6?
a) 64 b) 32 c) 128 d) None of these
B Trees are generally
a) very deep and narrow b) very wide and shallow c) very deep and very wide d) cannot say
The number of leaf nodes in a complete binary tree of depth d is
a) 2^d b) [2^(d-1)]+1 c) [2^(d+1)]+1 d) (2^d)+1
One can convert a binary tree into its mirror image by traversing it in
a) inorder b) preorder c) postorder d) any order
A full binary tree with n leaves contains
a) n nodes. b) (log2 n)nodes. c) (2n-1) nodes. d) 2^n nodes.
If a node in a BST has two children, then its inorder predecessor has
a) no left child b) no right child c) two children d) no child
A full binary tree with 2n+1 nodes contain
a) n leaf nodes b) n non-leaf nodes c) (n-1) leaf nodes d) (n-1) non-leaf nodes
The worst case time complexity of AVL tree is better in comparison to binary search tree for
a) Search and Insert Operations b) Search and Delete Operations c) Insert and Delete Operations d) Search, Insert and Delete Operations
What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?
a) O(nlogn) b) O(logn) c) O(n) d) O(n2)
What is a dequeue?
a) A queue with insert/delete defined for both front and rear ends of the queue b) A queue implemented with a doubly linked list c) A queue implemented with both singly and doubly linked lists d) None of the mentioned
You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ‘n’ and there are ‘m’ number of variables in this stack. The time complexity of performing dequeue operation is (Using only stack operations like push and pop)(Tightly bound)
a) O(m) b) O(n) c) O(m*n) d) Data is insufficient
What is the need for a circular queue?
a) effective usage of memory b) easier computations c) all of the mentioned d) none of the mentioned