Robert Bosch Arrays, Linked Lists, Trees, Graphs Quiz 3

The recursive method is mostly implemented using the stack data structure.

Recursion will call itself infinitely if the base condition is not defined, which results in a stack overflow exception.

Due to stack maintenance, recursion uses more system memory than iteration.

The margins of trees typically carry a lot of weight.
Additionally, the edges and the top trees match up exactly.
Top trees can therefore be initialized in O (n) time.

when several elements compete for the same bucket in the hash table is collision

Since there are fewer array positions in a hash table than there are keys, the hash function must be used to calculate the key's location in the array.

There are 11 calls to the recursive function.

If the nodes form a cluster, the leaves serve as edges, and the root of the top tree serves as a tree itself, then the top tree can be thought of as a binary tree.
The top tree is this known as a binary tree.

The formula fact(n) = n * fact(n - 1) can be used to get a number's factorial.

Load factor = (no. of elements)/ (number of slots) = 1000/20 = 50