The Wikipedia page for suffix trees descibes sibling lists as
Each node has a pointer to its first child, and to the next node in the child list it is a part of.
Wikipedia describes left-child right-sibling binary trees in the followeing manner:
Then, starting with the root, each node's leftmost child in the original tree is made its left child in the binary tree, and its nearest sibling to the right in the original tree is made its right child in the binary tree.
Lastly, acoording to Wikipedia, doubly-chained trees have the following property:
In a doubly-chained tree, each node has two pointers, one to the node's first child and one to its next sibling.
To me, these three definitions are exactly the same. Is there a difference?