Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #3552 > unrolled thread
| Started by | Victor Porton <porton@narod.ru> |
|---|---|
| First post | 2013-06-24 14:51 +0300 |
| Last post | 2013-06-24 14:51 +0300 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.programming
Iterating leaf tree nodes Victor Porton <porton@narod.ru> - 2013-06-24 14:51 +0300
| From | Victor Porton <porton@narod.ru> |
|---|---|
| Date | 2013-06-24 14:51 +0300 |
| Subject | Iterating leaf tree nodes |
| Message-ID | <kq9bsa$i1g$1@speranza.aioe.org> |
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 top | Article view | comp.programming
csiph-web