Hi. I am now having this problem...
So, i have a linked list that is ordered by an integer with lots of elements and i want to find the middle of the list that will be the root of the tree.. all fine so far...
Then i have to do the same with the sublists to find the respective right and left elements. So an exemple of this is can be...
list->1->2->3->4->5->6->7->...
4
/ \
2 6
/ \ / \
1 3 5 7
can someone help me with this ?
Thanks