I know the term order of a B-tree. Recently I heard a new term B tree with minimum degree of 2.
We know the degree is related with a node but what is degree of a tree.
Is degree imposes any kind of a restriction on height of a B-tree?
I don't think that degree of a tree is a standard term in either graph theory nor data structures. A degree is usually a property of a node/vertex of a graph, which denotes the number of its incident edges. For trees you sometimes consider only the edges to the children.
I suppose "B-tree with minimum degree of 2" means that every node has at least two children. In other words it is a lower bound for the number of children. On the other hand the order of a B-tree denotes the maximal node degree, and is therefore an upper bound.