M-tree from a scratch

hello every! i am working on project for an university course, i need to build from a  scratch a m-tree.

unfortunately I could not attend the course, so i am doing my best to figure out something good.

as can u see in the pic i really need those “return” statement in that points ,but elipsce dont like it. 

any suggest what i doing wrong?


the repo link is this https://github.com/DanerSound/ProgettoASD1718/pull/9 .

the main point is that each node must have ad least arieta sons.