except a tree or graph with multiple pointers is similar to linked list with one pointer.

where as a b-tree stored in an array without pointers probably shouldn't be called a b-tree.

or am I missing something?