📘 data structures

1. **Problem Statement:** Create a B+ tree of order 5 with the data values 30, 50, 80, 40, 10, 120, 20, 70, 100, 35, 90.

1. **Problem Statement:** Insert keys \{14, 30, 22, 10, 50, 60, 90\} into a hash table of size 8 using the hash function $$H(k) = k \bmod 8$$ and resolve collisions using linear pr

1. **State the problem:** We need to construct a splay tree with height 6 containing 10 elements, with the element 7 at level 6. Then, perform a split operation at the value 7. 2.

1. **Problem Statement:** We have a complete binary tree $T$ of size $n$ where the last level is fully filled from left to right.

1. The problem asks for the number of nodes at height $h$ in a complete binary tree $T$ of size $n$, where the last level is filled from left to right. 2. Recall: height of a node