Is the SQL Server B-tree index a flat structure or a depth structure

I was asked this question in an interview a few minutes ago, and I did not know the answer. I logically answered the idea that the B-Tree is always a depth structure because it has several levels. Was I right in my answer? What would be the best way to answer this question?

+5
source share
3 answers

Yes, you were right both in your answer and in your reasoning. A tree is never a flat structure. An example of a flat structure would be a single dimensional array.

+3
source

B-tree, therefore, the name will be a tree structure or depth.

+2
source

. , , , .

+1

All Articles