I am accustomed to a representation where inner nodes have N keys and N+1 children, the child in children[0] is less than the key in keys[0] and the child in children[1] has a key equal to keys[0]. Also, when splitting inner nodes, the middle key goes up, the key that refers to the children from children[0] (whose key isn't stored in the node) is the key that went up in the tree when it split. The tree visualizations shown in the video didn't follow any of those conventions. Are trees with representations other than what I described common?
