DSA_VIVA_3

A binary heap is best described as:

• A complete binary tree with sorted nodes

• A complete binary tree satisfying heap property

• A balanced binary search tree

• A full binary tree

In a max heap, the value of a parent node is:

• Less than its children

• Equal to its children

• Greater than or equal to its children

• Random compared to its children

Which operation takes O(log n) time in a binary heap?

• Searching

• Insertion

• Finding minimum

• Traversal

In a trie, each node represents:

• A complete word

• A character

• An integer

• A hash value

What is a collision in a hash table?

• When a key is deleted

• When two keys map to the same index

• When the table is full

• When searching fails

Which array index represents the left child of index i in a 0-based array heap?

• i + 1

• 2i

• 2i + 1

• 2i + 2

In an expression tree, internal nodes represent:

• Operands

• Constants

• Operators

• Variables

Which traversal of an expression tree produces infix notation?

• Preorder

• Inorder

• Postorder

• Level order

Expression tree evaluation is done using:

• Inorder traversal

• Preorder traversal

• Postorder traversal

• Level order traversal

For the expression (A+B)*C, the root node is:

• +

• A

• B

• *