简体   繁体   English

罗布森树遍历算法

[英]Robson tree traversal algorithm

Can anyone explain the Robson algorithm for tree traversal? 谁能解释树遍历的罗布森算法? I'm having trouble understanding what the steps of the algorithm are. 我在理解算法的步骤时遇到了麻烦。

Do you happen to have an assignment due on 5/12 that you are trying to complete? 您是否碰巧要在5/12上完成作业?

Robson tree traversals is just a way to traverse trees using a bunch of pointers. Robson树遍历只是使用一堆指针遍历树的一种方法。 The Steps Outlined Here do a very good job at outlining the procedures. 这里概述的步骤在概述过程方面做得很好。

I would recommend creating a tree with pen and paper and following the steps. 我建议使用笔和纸创建一棵树,并按照以下步骤操作。 It's the easiest way to wrap your head around all of pointers, and what they are doing. 这是将您的头缠绕在所有指针及其作用上的最简单方法。

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM