Given a 2-3 Tree in general , How should data be arranged to re-create the 2-3 tree ?
Explain the method
see attached word file
When you develop a 2-3 tree, keep in mind the following facts:
1.Every non-leaf node has either 2 or 3 children.
2.All leaves are at the same depth.
3.Information (keys and associated data) is stored only at leaves (internal nodes are for organization only).
4.Keys at leaves are ordered left to right.
5.In addition to child pointers, each internal node stores:
the value of the max key in the left subtree (leftMax) ...
Ideas to re-create the 2-3 tree are listed. The 2-3 trees are arranged.