red-black-tree:Ada 2012实施一棵红黑树

红黑树 这是Ada 2012对（一种自平衡二进制搜索树）的实现。 该树使用标准的Ada.Iterator_Interfaces进行迭代。 with Ada.Integer_Text_IO ; use Ada.Integer_Text_IO; with Ada.Text_IO ; use Ada.Text_IO; with Generic_Red_Black_Tree ; procedure Sample is package Int_Tree is new Generic_Red_Black_Tree (Integer); use Int_Tree; T: Red_Black_Tree; C: Cursor; begin -- populate the tree -- ... -- Ada 2005 iteration C