T-pyramid

From Wikipedia, the free encyclopedia

This article is orphaned as few or no other articles link to it. Please help introduce links in articles on related topics. (November 2006)

This article does not cite any references or sources. (May 2007) Please help improve this article by adding citations to reliable sources. Unverifiable material may be challenged and removed.

A T-pyramid is a tree in which every internal node has (exactly) 4 child-nodes.

The arcs of the tree need not be recorded because the nodes can be stored in depth-first traversal order as with a heap.