Consider a 13 element hash table for which f(key)=key mod 13 is used with integer keys. Assuming linear probing is used for collision resolution, at which location would the key 103 be inserted, if the keys 661, 182, 24 and 103 are inserted in that order?

A full binary tree has 31 nodes. How many leaf nodes does it have?

Traverse the given graph using  Breadth first search technique. Source node A, Policy: ascending order of the node

Which of the following statements is TRUE?

Traverse the given graph using Dept first traversal technique.   

Source node: b

What will be the start and end time of node h?

In a BST, what is the average-case height of a randomly built tree with n distinct keys?

If every key in an AVL tree is replaced with its mirror position (left ↔ right subtrees swapped recursively), will it remain an AVL tree?

A binary tree has height = 5 . What is the maximum number of nodes at level 3?

Which rotation is required when a node becomes left-heavy due to insertion in the right subtree of its left child?

Which node will be root if node 50 is deleted ?