Is there a term or a design pattern for an entity that traverses a tree
up vote
0
down vote
favorite
If you iterate over an array, you'd call that thing that iterates an Iterator.
What is the correct term for a thing going through an entire tree visiting every node and leaf? A traverser?
Is there a name design pattern for this?
design-patterns
asked Nov 20 at 12:26
Lukas
2,37043050
add a comment |
up vote
0
down vote
favorite
If you iterate over an array, you'd call that thing that iterates an Iterator.
What is the correct term for a thing going through an entire tree visiting every node and leaf? A traverser?
Is there a name design pattern for this?
design-patterns
asked Nov 20 at 12:26
Lukas
2,37043050
To the best of my knowledge iterators are not limited to arrays. As you can see from c++ std library.
– o_weisman
Nov 20 at 12:52
1
There are several patterns thattraversetrees and linked lists (such as Composite, Chain of Responsibility, Decorator, Interpreter etc). There are different ways to traverse a tree -traversals- ie visit all nodes once in whatever order. They could all be reasonable be called iterators, but there is no special term. Also an array looks suspiciously like a linked list, which is itself a special case of a tree.
– bcperth
Nov 21 at 23:54
@bcperth, that's a good answer. Why don't you post it as an answer rather than a comment? Comments are not intended for answers.
– jaco0646
Nov 26 at 18:25
@jaco0646 OK done. Was not sure I was addressing his concern, and there was no feedback.
– bcperth
Nov 26 at 22:10
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
If you iterate over an array, you'd call that thing that iterates an Iterator.
What is the correct term for a thing going through an entire tree visiting every node and leaf? A traverser?
Is there a name design pattern for this?
design-patterns
asked Nov 20 at 12:26
Lukas
2,37043050
If you iterate over an array, you'd call that thing that iterates an Iterator.
What is the correct term for a thing going through an entire tree visiting every node and leaf? A traverser?
Is there a name design pattern for this?
design-patterns
design-patterns
asked Nov 20 at 12:26
Lukas
2,37043050
asked Nov 20 at 12:26
Lukas
2,37043050
asked Nov 20 at 12:26
Lukas
2,37043050
asked Nov 20 at 12:26
Lukas
2,37043050
asked Nov 20 at 12:26
Lukas
2,37043050
2,37043050
To the best of my knowledge iterators are not limited to arrays. As you can see from c++ std library.
– o_weisman
Nov 20 at 12:52
1
There are several patterns thattraversetrees and linked lists (such as Composite, Chain of Responsibility, Decorator, Interpreter etc). There are different ways to traverse a tree -traversals- ie visit all nodes once in whatever order. They could all be reasonable be called iterators, but there is no special term. Also an array looks suspiciously like a linked list, which is itself a special case of a tree.
– bcperth
Nov 21 at 23:54
@bcperth, that's a good answer. Why don't you post it as an answer rather than a comment? Comments are not intended for answers.
– jaco0646
Nov 26 at 18:25
@jaco0646 OK done. Was not sure I was addressing his concern, and there was no feedback.
– bcperth
Nov 26 at 22:10
add a comment |
To the best of my knowledge iterators are not limited to arrays. As you can see from c++ std library.
– o_weisman
Nov 20 at 12:52
1
There are several patterns thattraversetrees and linked lists (such as Composite, Chain of Responsibility, Decorator, Interpreter etc). There are different ways to traverse a tree -traversals- ie visit all nodes once in whatever order. They could all be reasonable be called iterators, but there is no special term. Also an array looks suspiciously like a linked list, which is itself a special case of a tree.
– bcperth
Nov 21 at 23:54
@bcperth, that's a good answer. Why don't you post it as an answer rather than a comment? Comments are not intended for answers.
– jaco0646
Nov 26 at 18:25
@jaco0646 OK done. Was not sure I was addressing his concern, and there was no feedback.
– bcperth
Nov 26 at 22:10
To the best of my knowledge iterators are not limited to arrays. As you can see from c++ std library.
– o_weisman
Nov 20 at 12:52
To the best of my knowledge iterators are not limited to arrays. As you can see from c++ std library.
– o_weisman
Nov 20 at 12:52
1
1
There are several patterns that
traverse trees and linked lists (such as Composite, Chain of Responsibility, Decorator, Interpreter etc). There are different ways to traverse a tree - traversals - ie visit all nodes once in whatever order. They could all be reasonable be called iterators, but there is no special term. Also an array looks suspiciously like a linked list, which is itself a special case of a tree.– bcperth
Nov 21 at 23:54
There are several patterns that
traverse trees and linked lists (such as Composite, Chain of Responsibility, Decorator, Interpreter etc). There are different ways to traverse a tree - traversals - ie visit all nodes once in whatever order. They could all be reasonable be called iterators, but there is no special term. Also an array looks suspiciously like a linked list, which is itself a special case of a tree.– bcperth
Nov 21 at 23:54
@bcperth, that's a good answer. Why don't you post it as an answer rather than a comment? Comments are not intended for answers.
– jaco0646
Nov 26 at 18:25
@bcperth, that's a good answer. Why don't you post it as an answer rather than a comment? Comments are not intended for answers.
– jaco0646
Nov 26 at 18:25
@jaco0646 OK done. Was not sure I was addressing his concern, and there was no feedback.
– bcperth
Nov 26 at 22:10
@jaco0646 OK done. Was not sure I was addressing his concern, and there was no feedback.
– bcperth
Nov 26 at 22:10
add a comment |
1 Answer
1
active
oldest
votes
up vote
1
down vote
There are several patterns that traverse trees and linked lists (such as Composite, Chain of Responsibility, Decorator, Interpreter etc).
There are different ways to traverse a tree - traversals - ie visit all nodes once in whatever order. They could all be reasonable be called iterators, but there is no special term.
Also its worth considering that an array looks suspiciously like a linked list, which is itself a special case of a tree.
answered Nov 26 at 22:08
bcperth
1,9951514
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53392976%2fis-there-a-term-or-a-design-pattern-for-an-entity-that-traverses-a-tree%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
There are several patterns that traverse trees and linked lists (such as Composite, Chain of Responsibility, Decorator, Interpreter etc).
There are different ways to traverse a tree - traversals - ie visit all nodes once in whatever order. They could all be reasonable be called iterators, but there is no special term.
Also its worth considering that an array looks suspiciously like a linked list, which is itself a special case of a tree.
answered Nov 26 at 22:08
bcperth
1,9951514
add a comment |
up vote
1
down vote
There are several patterns that traverse trees and linked lists (such as Composite, Chain of Responsibility, Decorator, Interpreter etc).
There are different ways to traverse a tree - traversals - ie visit all nodes once in whatever order. They could all be reasonable be called iterators, but there is no special term.
Also its worth considering that an array looks suspiciously like a linked list, which is itself a special case of a tree.
answered Nov 26 at 22:08
bcperth
1,9951514
add a comment |
up vote
1
down vote
up vote
1
down vote
There are several patterns that traverse trees and linked lists (such as Composite, Chain of Responsibility, Decorator, Interpreter etc).
There are different ways to traverse a tree - traversals - ie visit all nodes once in whatever order. They could all be reasonable be called iterators, but there is no special term.
Also its worth considering that an array looks suspiciously like a linked list, which is itself a special case of a tree.
answered Nov 26 at 22:08
bcperth
1,9951514
There are several patterns that traverse trees and linked lists (such as Composite, Chain of Responsibility, Decorator, Interpreter etc).
There are different ways to traverse a tree - traversals - ie visit all nodes once in whatever order. They could all be reasonable be called iterators, but there is no special term.
Also its worth considering that an array looks suspiciously like a linked list, which is itself a special case of a tree.
answered Nov 26 at 22:08
bcperth
1,9951514
answered Nov 26 at 22:08
bcperth
1,9951514
answered Nov 26 at 22:08
bcperth
1,9951514
answered Nov 26 at 22:08
bcperth
1,9951514
1,9951514
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53392976%2fis-there-a-term-or-a-design-pattern-for-an-entity-that-traverses-a-tree%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
To the best of my knowledge iterators are not limited to arrays. As you can see from c++ std library.
– o_weisman
Nov 20 at 12:52
1
There are several patterns that
traversetrees and linked lists (such as Composite, Chain of Responsibility, Decorator, Interpreter etc). There are different ways to traverse a tree -traversals- ie visit all nodes once in whatever order. They could all be reasonable be called iterators, but there is no special term. Also an array looks suspiciously like a linked list, which is itself a special case of a tree.– bcperth
Nov 21 at 23:54
@bcperth, that's a good answer. Why don't you post it as an answer rather than a comment? Comments are not intended for answers.
– jaco0646
Nov 26 at 18:25
@jaco0646 OK done. Was not sure I was addressing his concern, and there was no feedback.
– bcperth
Nov 26 at 22:10