Changes

The '''binary tree''' is the simplest, and most commonly used, form of [[tree (data structure)|tree]].  A binary tree differs from other trees (such as a B3 tree) in that each node only has two links to other nodes.  By convention, these links are called the '''left''' and '''right''' links.  Data sorted before a node is inserted into the tree via the left link of that node, while data that sorts after is inserted into the tree via the right link.

The '''binary tree''' is the simplest, and most commonly used, form of [[tree (data structure)|tree]].  A binary tree differs from other trees (such as a B3 tree) in that each node only has two links to other nodes.  By convention, these links are called the '''left''' and '''right''' links.  Data sorted before a node is inserted into the tree via the left link of that node, while data that sorts after is inserted into the tree via the right link.

Note that sometimes an additional '''parent''' link is used to point back to the node's parent in the tree, however this link is implied by the parent's left or right link.  Parent links are used to reduce the otherwise necessary context that must be kept during tree traversal, but they are not considered when describing the tree.  Thus, a binary tree with a parent link is not considered a B3 tree.  The root node of a tree is the node with no parent.  It is the point from which all traversals begin.

Note that sometimes an additional '''parent''' link is used to point back to the node's parent in the tree, however this link is implied by the parent's left or right link.  Parent links are used to reduce the otherwise necessary context that must be kept during tree traversal, but they are not considered when describing the tree.  Thus, a binary tree with parent links is not considered a B3 tree.  The root node of a tree is the node with no parent.  It is the point from which all traversals begin.

==Balanced Trees==

==Balanced Trees==