I am creating a genealogical tree in java, however, the saved data must be string, they must have the possibility of having several brothers and the parents must go to the left, mothers to the right. My problem is the creation of this tree itself, as it is binary I can not have several nodes on the same level in relation to a person to what I understand since each node has only 2 options .. The fact that the data to be handled is string also complicates me since I can not do a simple tour of values and insert a node in the corresponding sheet depending on its value.
It confuses me a lot that I can not use an entire value to fill the tree.
What type of implementation of binary tree could apply in this situation? How could you relate these nodes to siblings if a binary tree by definition only has 2 sheets?