Editing Binary tree (section)

=== Insertion ===
Nodes can be inserted into binary trees in between two other nodes or added after a [[leaf node]]. In binary trees, a node that is inserted is specified as to whose child it will be.

==== Leaf nodes ====
To add a new node after leaf node A, A assigns the new node as one of its children and the new node assigns node A as its parent.

==== Internal nodes ====
[[File:Insertion of binary tree node.svg|thumb|360px|The process of inserting a node into a binary tree]]
Insertion on [[internal node]]s is slightly more complex than on leaf nodes. Say that the internal node is node A and that node B is the child of A. (If the insertion is to insert a right child, then B is the right child of A, and similarly with a left child insertion.) A assigns its child to the new node and the new node assigns its parent to A. Then the new node assigns its child to B and B assigns its parent as the new node.