c539aec8eeff3a0ebb71088fb19801f11e5f401d34f77d557b018dfe95f498fcfbd2088d136d646b53e76e79cadc6aaa350212067a34ded2a9a2d

471e5a31b92a48d3314bab4eabb1cf450098dec97e37d807351f56da11f7c6d778cfcb336ca62ea32d3d96ca420f5763a2e828f94683c65ef729c

bb6978492023f5ad411db6d0ae08cb2d27aa5e0fe97589a2d600c49f44d9110969364910b4c2bd708fbc0882749db8e885360d74f08fa5bc8f659

红黑树(red black tree)特点 一个节点是红色或黑色 根节点是黑色 如果一个节点是红色，那么它的子节点必须是黑色 一个节点到一个null引用的每一条路径必须包含相同数目的黑色节点(红色节点不影响) 两种旋转方式和一种颜色变换

f215e7d91857250010c52036561f46c03d2ec86c800150d04c9ac32352e4850837806867ba492d25ab7ede191c5be590d68cbf41742a08f3dcb22

759c228569e7f42a620f124b1db7dd3752b25ace8c1fbea686ca16bc724e832d7697e45b05bf7da6bf204fb6e89306c4865fdb00a78ab0832e464

4e773dea06df44d07a053cd478bd8e4f3c858904d5ee4f27447190ebf10d7cd80f7e5ebf755dcaadac4f8c974b764dbc83d348f915595ed6508b4

8585569ea8d64905d299fe272365a700ca6e3fa4fbb7cf007c7d0ae629bd04dfd6e8473e8eac0e6634412fce4e88da11ecead7a6b1d3d517e9cd6

1d440f2ff7b6bc134a91f13275bdf3d037f3262b234a2d54712726816129209b70047235f94087375c568edf4bb6eb8a8aadde640417f45d480a2

512657d7d4beec310b32cec8047adf2b26f54b228c7531a46f19422d1ef1094b29b8bcd8d6353748b5afc8cc0ed29b17a9c75400711e47ff1334a

ab6c1c4e6ce4fdff9b57857fc7e477650806a016f35cb25c112de7f5e9aa39de8d0bdab53fb9c27ab641f98064e7dbe11be1b7120feddc42f91ce

ab6c1c4e6ce4fdff9b57857fc7e477650806a016f35cb25c112de7f5e9aa39de8d0bdab53fb9c27ab641f98064e7dbe183418d61e0ef2e6782a34