How are we using right pointer of a tree node in a linked list

#1

int the code it is writtten leftLL.tail->right how can we access right pointer in a linked list whereas it is of a tree node class property

#2

when we convert tree to linked list

the list will be doubly linked list
next(pointer) will be right
and prev(pointer) will be left

#3

can you elaborate more the whole thing please i have seen videos 2 times

#4

a node in tree has two pointers left and right
we use these pointer as next and prev pointers in linked list to make doubly linked List

Reference Code

check out this code
if you have any doubt in this
feel free to ask doubt