T-pyramid

From Wikipedia, the free encyclopedia

There are very few or no other articles that link to this one.
Please help introduce links in articles on related topics. After links have been created, remove this message.
This article has been tagged since November 2006.

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.


Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../t/-/p/T-pyramid.html"