Content deleted Content added
+uk |
No edit summary |
||
Line 73:
current := next
</pre>
The above algorithm is wrong. If current := next everytime, so whenever next becomes null,
current becomes null, and hence the algorithm gets prematurely terminated.
[[uk:Обхід дерева]]
|