用于 RedBlackTree 实现的自定义类 STL 迭代器

Question

我需要一个类似 STL 的双向迭代器（operator

template<typename K, typename V> class rbtree {  
public:  
  rbtree(){  
    root = NULL;  
    numberElements = 0;  
    insertedNode = NULL;  
    nodeBeingDeleted = NULL; // Set in DeleteNode  
    siblingToRight = false; // Sibling of curNode  
    parentToRight = false; // Of grand parent  
    nodeToDeleteRed = false; // Color of deleted node  
  }  
  //...  
private:  
  struct Node {  
    // Fields  
    K key; // Generic object held by each node  
    Node* left; Node* right; Node* parent; // Links to children and parent  
    bool red;// = true; // Color of node  
    // Constructor  
    Node(){  
      red = true;  
    }  
    Node(K key, Node* parent) {  
      this->key = key;  
      this->parent = parent;  
      left = NULL; right = NULL;  
      red = true;  
    }  
  };  
  // Fields  
  Node* root;  
  //...  
};

Answer 1

您会惊讶地发现 std::set 被实现为红黑树。你自己写一篇的原因是什么？

真正的答案是：编写迭代器并非易事。您应该阅读迭代器要求之间的常见差异。 This Stackoverflow question 是您问题的一种重复，并提供了有用的提示。