正在加载图片...
Example of a red-black tree 7 18 NILNIL 10 26 NIL NIL NILNIL NIL NIL 3. If a node is red then its parent is black o 2001 by Charles E Leiserson Introduction to Algorithms Day 18 L10.7© 2001 by Charles E. Leiserson Introduction to Algorithms Day 18 L10.7 Example of a red-black tree 88 1111 1010 1818 2626 2222 33 77 NIL NIL NIL NIL NIL NIL NIL NIL NIL 3. If a node is red, then its parent is black
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有