[Home]Ordered tree data structure

HomePage | Recent Changes | Preferences

Strictly speaking, in a tree, there is no distinction between the various children of a node --- none is the "first child" or "last child". A tree in which such distinctions are made is called an ordered tree. Binary trees are one kind of ordered tree, and there is a one-to-one mapping between binary trees and general ordered trees.

HomePage | Recent Changes | Preferences
This page is read-only | View other revisions
Last edited October 26, 2001 1:43 am by 209.157.137.xxx (diff)