User

If you add data into a $2-4$ tree in sorted, ascending order, what behavior do you observe? Is this a good or a bad thing?

Every data added becomes the right$-$most element of the right$-$most leaf node.

After adding many elements $(>100),$ almost every node in the tree will have the max number of data.

After adding many elements $(>100),$ almost every node in the tree will have the max number of children.

As we continue to add elements, the left side of the tree slowly starts to resemble a binary search tree if we promote the $2$nd data.

As we continue to add elements, the right side of the tree slowly starts to resemble a binary search tree if we promote the $3$rd data.

The tree becomes degenerate since we are always adding to the right side of the tree.

Every add operation takes strictly O$($log n$)$ time since we travel from root to leaf.