(A) Binary

(B) Unary

(C) Ternary

(D) None of the above

### Related Posts 👇

**The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should?**(A) Use better data structures

(B) Increase the hard disk space

(C) Use the better algorithm

(D) Use as much data as we can store on the hard disk

**Which of the following is a non linear data structure?**(A) Linked list

(B) Stack

(C) Queue

(D) Tree

**Which traversal gives a decreasing order of elements in a heap where the max element is stored at the top?**(A) Post-order

(B) Level-order

(C) Inorder

(D) None of the above

**While joining nodes in the building of Huffman encoding tree if there are more nodes with same frequency, we choose the nodes?**(A) Randomly

(B) That occur first in the text message

(C) That are lexically smaller among others

(D) That are lexically greater among others

**We can build a heap in __ time.**(A) Linear

(B) Exponential

(C) Polynomial

(D) None of the above

**Which of the following statement is NOT true about threaded binary tree?**(A) Right thread of the right-most node points to the dummy node

(B) Left thread of the left-most node points to the dummy node

(C) The left pointer of dummy node points to the root node of the tree

(D) Left thread of the right-most node points to the dummy node

**Which of the following statement is correct?**(A) 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

(B) 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

(C) 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

(D) 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

**In the worst case of deletion in AVL tree requires?**(A) Only one rotation

(B) Rotation at each non-leaf node

(C) Rotation at each leaf node

(D) Rotations equal to log2 N