Where t can be considered as the branching factors. All the leaves will have the same depth and this depth is also the height of the tree. As a result, every node can has either no key or 1 key. Any node that has no keys and 1 children is called unary node . Also, if there exist right neighbour, its first k right neighbours are binary.
All leaves have the same depth.
If there exist at least k right neighbour, the first k right neighbour of v have 2 child, otherwise all the right neighbours have 2 child. Angewandte Informatik und Formale Beschreibungsverfahren, Universitat Karlsruhe, Fed. Using the idea of binary tree data structure, they invented a new data structure called k-tree. Because of the small height of the k-tree, the cost of searching the tree is further decrease. As a result, operation like examination, insertion and deletion can be carried out efficiently.