Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #3552
| From | Victor Porton <porton@narod.ru> |
|---|---|
| Newsgroups | comp.programming |
| Subject | Iterating leaf tree nodes |
| Followup-To | comp.programming |
| Date | 2013-06-24 14:51 +0300 |
| Organization | Aioe.org NNTP Server |
| Message-ID | <kq9bsa$i1g$1@speranza.aioe.org> (permalink) |
Followups directed to: comp.programming
Is iterating all nodes and filtering the set of traversed nodes the best way to implement traversal of only leaf nodes of a tree (where the leaf nodes are exactly the nodes of depth $maxDepth)? Or is there a shorter algorithms to traverse leaf nodes only (where all leaf nodes are of the same fixed depth)? -- Victor Porton - http://portonvictor.org
Back to comp.programming | Previous | Next | Find similar | Unroll thread
Iterating leaf tree nodes Victor Porton <porton@narod.ru> - 2013-06-24 14:51 +0300
csiph-web