595 Madison Avenue
New York, NY 10022
p: 212.822.4821
f: 212.822.4820
From: Jeff Tapper
[mailto:[EMAIL PROTECTED]
Sent: Friday, February 04, 2005
1:56 PM
To: [EMAIL PROTECTED]
Subject: RE: [flexcoders] tree
traversal?
Here's a snippet from a recent project which loops throug
adison Avenue
New York, NY 10022
p: 212.822.4821
f: 212.822.4820
--
From: Robert Stuttaford [mailto:[EMAIL PROTECTED]
Sent: Friday, February 04, 2005 1:03 PM
To: flexcoders@yahoogroups.com
Subject: RE: [flexcoders] tree traversal?
An addition:
Function findthatnode( parent node, nodeID ) {
PROTECTED]
Sent: Friday, February 04, 2005
1:03 PM
To: [EMAIL PROTECTED]
Subject: RE: [flexcoders] tree
traversal?
An addition:
Function findthatnode( parent node, nodeID
) {
Loop through parent node’s children:
If current child node is the one with
[mailto:[EMAIL PROTECTED]
Sent: 04 February 2005 07:57PM
To: flexcoders@yahoogroups.com
Subject: RE: [flexcoders] tree
traversal?
Recursion, at it’s simplest, works
like this:
function foo () {
foo();
}
A function that calls itself – or,
put another way, a function that
Recursion, at it’s simplest, works
like this:
function foo () {
foo();
}
A function that calls itself – or,
put another way, a function that calls a COPY of itself.
In pseudo code:
Function findthatnode( parent node, nodeID
) {
Loop
through parent
5 matches
Mail list logo
