Home/ Questions/Q 1088695
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-16T23:06:27+00:00

Can anyone please suggest me any pointer to an iterative algorithm for insertion and

  • 0

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?

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.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    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

    1. Article
    2. C Source
    3. VB Source

    Hope someone will find it helpful. 🙂

    • 0