Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A ternary tree is a tree data structure in computer science. Generally each ternary tree has to have one special node (called root) at the topmost level. Each node has at most three children. A Tree structure is a way of representing the hierarchical nature of a structure in a graphical form. In computer science, a tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes. Mathematically, it is a tree, more specifically an arborescence: an acyclic connected graph where each node has zero or more children nodes and at most one parent node. Furthermore, the children of each node have a specific order.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.