Is a SQL Server index B-tree a flat structure or a depth structure
data-structures, indexing, sql, sql-server-2008
Solution
Yes, you were right in both your answer and your reasoning. A tree is never a flat structure. An example of a flat structure would be a single dimension array.
Problem
I was asked this question on the interview a few minutes ago and I didnt know the answer. I answered it logically thinking that a B-Tree is always a depth structure because it has multiple levels. Was I right on my answer? What would be the best way to answer this question?