Hi, i have passed my exam from java programming, but i have to solve one more homework. Its about B-tree implementation :/ i dont really know, how to do it. I have a few lines of code but its no working properly.
When i define the number of keys in node, i can add them, but if i add one more key, there is a null.pointer.exception. And with remove method i dont know
Here is a task and my code.