Question

The system will support range queries, when stored in main memory, working on a dynamic database (supports inserts and deletes).
Binary Search Tree (assume that it is balanced)
Closed Hash Table
Linear Index
B+ Tree

Answer 1

When working with the dynamic database Binary Search Tree, the system will handle range queries when the data is kept in main memory.

How many nodes must there be in a binary tree with three levels?

23+1 - 1 = 15 nodes make up a complete binary tree of height 3. Consequently, 300 bytes are needed to store the tree. The tree will have 7 nodes if it has a minimum of 3 nodes and a height of 3.

In a tree, what is depth?

The depth of a tree is defined as all of the edges that connect the root node to a certain node. The depth of the tree is measured by counting all the edges along the longest path from the root node to the leaf node.

To know more about Binary Search visit :-

https://brainly.com/question/29734003

#SPJ4