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

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

In a trie, each node represents:

What is a collision in a hash table?

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

In an expression tree, internal nodes represent:

Which traversal of an expression tree produces infix notation?

Expression tree evaluation is done using:

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

The maximum number of nodes in a binary tree of height h is:

The number of null pointers in a binary tree with n nodes is:

The maximum number of nodes at level i of a binary tree is:

Which traversal is used to copy a binary tree?

In a Binary Search Tree, the left subtree of a node contains:

The average time complexity of searching an element in a BST is:

The worst-case time complexity of search in a BST occurs when the tree is:

The minimum element in a BST is found by traversing:

Duplicate values in a BST are:

Which case of deletion in BST is most complex?