任何人都可以请建议我任何指针，迭代算法插入和删除成红 - 黑树？所有在.net / C＃中可用的算法是基于递归，我不能相信对于处理大量的数据（因此大量的递归深度插入/删除）。是否基于迭代的人有吗？

Can anyone please suggest me any pointer to an iterative algorithm for insertion and deletion into a Red-Black Tree? All the algorithms available in .Net/C# are based on recursion, which I can't trust for handling very large number of data (hence large number of recursion depth for insertion/deletion). Does anybody have one based on iteration?

注：Goletas.Collection使用迭代算法AVL树这对大量数据的高效，我想类似的事情了红黑树也

Note : Goletas.Collection uses an iterative algorithm for AVL tree which is highly efficient for large number of data, I want similar thing for Red-Black Tree also.

推荐答案

谢谢大家对您的宝贵意见。我刚刚发现一个，但在VB6和C我认为它足够把握的想法。下面是链接

Thanks everyone for your valuable comments. I just found one but in VB6 and C. I think its enough to grasp the idea. Here are the links

希望有人会发现它的帮助。 ：）

Hope someone will find it helpful. :)