Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
My question is, does this have a proper name. (ie. has it been invented before)?
A (file-efficient) tree structure configured as a tree of linked lists, in the following fashion:
As can be seen, instead of each node having to remember a ‘list’ of children, it lists one child and this links to other siblings using a linked list. This way the space requirement for all nodes is constant (2).
This is a representation of a k-ary tree as a binary tree, known as left child – right sibling binary tree.