红黑树(RB-Tree)浅析
in Solutions with 1 comment

红黑树(RB-Tree)浅析

in Solutions with 1 comment

红黑树(RB-Tree)浅析

红黑树是一个二叉树,具有如下性质:

查找:

跟BST的查找一样的。

插入:

  1. Z=root
    //TO DO 哪天理解了自己默写吧
  2. Z.uncle=red
    //TO DO
  3. z.uncle=black(triangle)
    //TO DO
  4. Z.uncle=black(line)
    //TO DO

删除:

时间复杂度分析:

Responses
  1. Viagra Vendita Best Price On Cialis 5mg п»їcialis Can I Buy Allegra D Online Amoxicillin Osage For 7 Month Old

    Reply