<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462019000401375</article-id>
<article-id pub-id-type="doi">10.13053/cys-23-4-3108</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Partitioned Binary Search Trees: a Generalization of Red Black Trees]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Zouana]]></surname>
<given-names><![CDATA[Seyfeddine]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Zegour]]></surname>
<given-names><![CDATA[Djamel Eddine]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Ecole nationale Supèrieure d'Informatique Laboratoire de la Communication dans les Systèmes Informatiques ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Algeria</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2019</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2019</year>
</pub-date>
<volume>23</volume>
<numero>4</numero>
<fpage>1375</fpage>
<lpage>1391</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462019000401375&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462019000401375&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462019000401375&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract We propose a generalized form for Red Black Trees. The structure, called Partitioned Binary Search Trees, tolerates finite successions of Red nodes provoking a degree of imbalance while reducing the number of maintenance operations and speeding up the updates. The tree is interesting not only because of its simple operations but also because it insures the same level of performance of Red Black Trees O(log n) and allows an even higher adaptability and efficiency rate in different fields where rebalancing is costly.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Red black trees]]></kwd>
<kwd lng="en"><![CDATA[B-trees]]></kwd>
<kwd lng="en"><![CDATA[generalization]]></kwd>
<kwd lng="en"><![CDATA[relaxation]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Adelson-Velskii]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Landis]]></surname>
<given-names><![CDATA[E. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An Algorithm for the Organization of Information]]></article-title>
<source><![CDATA[Doklady Akademii Nauk USSR]]></source>
<year>1962</year>
<volume>146</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>263-6</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Andersson]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Balanced search trees made simple]]></article-title>
<source><![CDATA[Proc. 3rd Workshop on Algorithms and Data Structures]]></source>
<year>1993</year>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Baer]]></surname>
<given-names><![CDATA[J.-L.]]></given-names>
</name>
<name>
<surname><![CDATA[Schwab]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A comparison of tree-balancing algorithms]]></article-title>
<source><![CDATA[Commun. ACM]]></source>
<year>1977</year>
<volume>20</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>322-30</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Balasa]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Maruvada]]></surname>
<given-names><![CDATA[S. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Krishnamoorthy]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Using red-black interval trees in device-level analog placement with symmetry constraints]]></article-title>
<source><![CDATA[Proceedings of the 2003 Asia and South Pacific Design Automation Conference]]></source>
<year>2003</year>
<page-range>777-82</page-range><publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[ASP-DAC '03]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Baldan]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Corradini]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Esparza]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Heindel]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[König]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Kozioura]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Verifying red-black trees]]></article-title>
<source><![CDATA[Proc. of COSMICAH '05]]></source>
<year>2005</year>
<publisher-name><![CDATA[Queen Mary, University of London]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bayer]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Binary b-trees for virtual memory]]></article-title>
<source><![CDATA[Proceedings of the 1971 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control]]></source>
<year>1971</year>
<page-range>219-35</page-range><publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[SIGFIDET '71, ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bayer]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Symmetric binary b-trees: Data structure and maintenance algorithms]]></article-title>
<source><![CDATA[Acta Informatica]]></source>
<year>1972</year>
<volume>1</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>290-306</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bayer]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[McCreight]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Organization and maintenance of large ordered indices]]></article-title>
<source><![CDATA[Proceedings of the 1970 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control]]></source>
<year>1970</year>
<page-range>107-41</page-range><publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[SIGFIDET '70]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bose]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Douïeb]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Langerman]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dynamic optimality for skip lists and b-trees]]></article-title>
<source><![CDATA[Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '08]]></source>
<year>2008</year>
<page-range>1106-14</page-range><publisher-loc><![CDATA[Philadelphia, PA, USA ]]></publisher-loc>
<publisher-name><![CDATA[Society for Industrial and Applied Mathematics]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boumerzoug]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Amar Bensaber]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Biskri]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A key management method based on an AVL tree and ECC cryptography for wireless sensor networks]]></article-title>
<source><![CDATA[Proceedings of the 7th ACM Symposium on QoS and Security for Wireless and Mobile Networks, Q2SWinet '11]]></source>
<year>2011</year>
<page-range>57-62</page-range><publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bounif]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Zegour]]></surname>
<given-names><![CDATA[D. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Toward a unique representation for AVL and red-black trees]]></article-title>
<source><![CDATA[Computación y Sistemas]]></source>
<year>2019</year>
<volume>23</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carbon]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Lhuillier]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Charles]]></surname>
<given-names><![CDATA[H.-P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Code specialization for red-black tree management algorithms]]></article-title>
<source><![CDATA[Proceedings of the 3rd International Workshop on Adaptive Self-Tuning Computing Systems]]></source>
<year>2013</year>
<page-range>6:1-3</page-range><publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dean]]></surname>
<given-names><![CDATA[B. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Jones]]></surname>
<given-names><![CDATA[Z. H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Exploring the duality between skip lists and binary search trees]]></article-title>
<source><![CDATA[ACM Southeast Regional Conference]]></source>
<year>2007</year>
<page-range>395-9</page-range><publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Foster]]></surname>
<given-names><![CDATA[C. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Information retrieval: information storage and retrieval using AVL trees]]></article-title>
<source><![CDATA[ACM '65: Proceedings of the 1965 20th national conference]]></source>
<year>1965</year>
<page-range>192-205</page-range><publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Foster]]></surname>
<given-names><![CDATA[C. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A generalization of AVL trees]]></article-title>
<source><![CDATA[Commun. ACM]]></source>
<year>1973</year>
<volume>16</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>513-7</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guibas]]></surname>
<given-names><![CDATA[L. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Sedgewick]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A dichromatic framework for balanced trees]]></article-title>
<source><![CDATA[Foundations of Computer Science, 19th Annual Symposium on]]></source>
<year>1978</year>
<page-range>8-21</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Haeupler]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Sen]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Tarjan]]></surname>
<given-names><![CDATA[R. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Rank-balanced trees]]></article-title>
<source><![CDATA[ACM Trans. Algorithms]]></source>
<year>2015</year>
<volume>11</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>30:1-30:26</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hanke]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Ottmann]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Soisalon-Soininen]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Relaxed balanced red-black trees]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Bongiovanni]]></surname>
<given-names><![CDATA[G. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Bovet]]></surname>
<given-names><![CDATA[D. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Battista]]></surname>
<given-names><![CDATA[G. D.]]></given-names>
</name>
</person-group>
<source><![CDATA[CIAC]]></source>
<year>1997</year>
<page-range>193-204</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Holenderski]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Bril]]></surname>
<given-names><![CDATA[R. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Lukkien]]></surname>
<given-names><![CDATA[J. J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Red-black trees with relative node keys]]></article-title>
<source><![CDATA[Information Processing Letters]]></source>
<year>2014</year>
<volume>114</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>591-6</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Howard]]></surname>
<given-names><![CDATA[P. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Walpole]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Relativistic red-black trees]]></article-title>
<source><![CDATA[Concurrency and Computation: Practice and Experience]]></source>
<year>2014</year>
<volume>26</volume>
<numero>16</numero>
<issue>16</issue>
<page-range>2684-712</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Karlton]]></surname>
<given-names><![CDATA[P. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Fuller]]></surname>
<given-names><![CDATA[S. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Scroggs]]></surname>
<given-names><![CDATA[R. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Kaehler]]></surname>
<given-names><![CDATA[E. B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Performance of height-balanced trees]]></article-title>
<source><![CDATA[Commun. ACM]]></source>
<year>1976</year>
<volume>19</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>23-8</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kurilova]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Rayside]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the simplicity of synthesizing linked data structure operations]]></article-title>
<source><![CDATA[SIGPLAN Not.]]></source>
<year>2013</year>
<volume>49</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>155-8</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nievergelt]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Binary Search Trees and File Organization]]></article-title>
<source><![CDATA[ACM Comput. Surv.]]></source>
<year>1974</year>
<volume>6</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>195-207</page-range></nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nievergelt]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Reingold]]></surname>
<given-names><![CDATA[E. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Binary search trees of bounded balance]]></article-title>
<source><![CDATA[Proceedings of the Fourth Annual ACM Symposium on Theory of Computing]]></source>
<year>1972</year>
<page-range>137-42</page-range><publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nievergelt]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wong]]></surname>
<given-names><![CDATA[C. K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Upper bounds for the total path length of binary trees]]></article-title>
<source><![CDATA[J. ACM]]></source>
<year>1973</year>
<volume>20</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-6</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Okasaki]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Alternatives to two classic data structures]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Dann]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Naps]]></surname>
<given-names><![CDATA[T. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Tymann]]></surname>
<given-names><![CDATA[P. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Baldwin]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[SIGCSE]]></source>
<year>2005</year>
<page-range>162-5</page-range><publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<label>27</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ottmann]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Six]]></surname>
<given-names><![CDATA[H. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Wood]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Right brother trees]]></article-title>
<source><![CDATA[Commun. ACM]]></source>
<year>1978</year>
<volume>21</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>769-76</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Parallel algorithms for red-black trees]]></article-title>
<source><![CDATA[Theoretical Computer Science]]></source>
<year>2001</year>
<volume>262</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>415-35</page-range></nlm-citation>
</ref>
<ref id="B29">
<label>29</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ralston]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[ACL2-certified AVL trees]]></article-title>
<source><![CDATA[Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and Its Applications]]></source>
<year>2009</year>
<page-range>71-4</page-range><publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B30">
<label>30</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rolfe]]></surname>
<given-names><![CDATA[T. J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[One-time binary search tree balancing: the day/stout/warren (DSW) algorithm]]></article-title>
<source><![CDATA[SIGCSE Bulletin]]></source>
<year>2002</year>
<volume>34</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>85-8</page-range></nlm-citation>
</ref>
<ref id="B31">
<label>31</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sedgewick]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Left-Leaning red black trees]]></source>
<year>2008</year>
</nlm-citation>
</ref>
<ref id="B32">
<label>32</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sen]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Tarjan]]></surname>
<given-names><![CDATA[R. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Deletion without rebalancing in balanced binary trees]]></article-title>
<source><![CDATA[Proceedings of the Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms]]></source>
<year>2010</year>
<page-range>1490-9</page-range><publisher-loc><![CDATA[Philadelphia, PA, USA ]]></publisher-loc>
<publisher-name><![CDATA[Society for Industrial and Applied Mathematics]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B33">
<label>33</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Stout]]></surname>
<given-names><![CDATA[Q. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Warren]]></surname>
<given-names><![CDATA[B. L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tree rebalancing in optimal time and space]]></article-title>
<source><![CDATA[Commun. ACM]]></source>
<year>1986</year>
<volume>29</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>902-8</page-range></nlm-citation>
</ref>
<ref id="B34">
<label>34</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Strbac-Savi&#263;]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Toma&#353;evi&#263;]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Comparative performance evaluation of the AVL and red-black trees]]></article-title>
<source><![CDATA[Proceedings of the Fifth Balkan Conference in Informatics]]></source>
<year>2012</year>
<page-range>14-9</page-range><publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B35">
<label>35</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tan]]></surname>
<given-names><![CDATA[K. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On Foster's information storage and retrieval using AVL trees]]></article-title>
<source><![CDATA[Commun. ACM]]></source>
<year>1972</year>
<volume>15</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>843</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
