true or false

J. In a B-tree, all leaves are on the same level. K. In a B-tree, the data values in each node are in ascending order. L. The maximum number of data records in a node of a B-tree of order M could be M. M. In an AVL tree, the longest and the shortest paths (number of edges) from the root to a leaf do not differ by more than 1. N. The rotation operation in an AVL can be done in constant time. 0. In an AVL tree, rotations may not maintain the Inorder ordering of keys. E. The largest element in a Min-heap will always be at a leaf node of the tree structure