I am not asking anyone to do my homework for me. I just need some help as I am new to Java. I understand the concept of Binary Trees and RB trees. I just don't know how to implement this in Java.
So my question is:
Will doubly linked lists be the best way to go about coding red-black trees? Or any other suggestions?
I am confused about whether it will be possible to form the tress structure with linked lists?
I'm sorry if I am not being clear. I do not know how to code a tree.
I understand what a Binary Tree and Red Black Tree is; but I have never coded either.
I understand that trees have nodes. How do I code these nodes? Are they the same nodes used to code a linked list??