Question: how b tree index works?
Answer: A b-tree index works by creating a series of nodes in a hierarchy. It's often compared to a tree, which has a root, several branches, and many leaves. ... Find the node that covers the range of values that span the value of 109 (for example, a range of 100 to 200). Move to the second level from this node.