Дерево с индексами (Binary indexed tree)

algorithms-and-data-structures/data-structures/binary-indexed-tree Created with Sketch.
Скачать
<?xml version="1.0" encoding="UTF-8"?> <svg width="800px" height="800px" viewBox="0 0 73 73" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> <title>algorithms-and-data-structures/data-structures/binary-indexed-tree</title> <desc>Created with Sketch.</desc> <defs> </defs> <g id="algorithms-and-data-structures/data-structures/binary-indexed-tree" stroke="none" stroke-width="1" fill="none" fill-rule="evenodd"> <g id="container" transform="translate(2.000000, 2.000000)" fill="#FFFFFF" fill-rule="nonzero" stroke="#3E1E1A" stroke-width="2"> <rect id="mask" x="-1" y="-1" width="71" height="71" rx="14"> </rect> </g> <g id="plant" transform="translate(19.000000, 14.000000)" fill-rule="nonzero"> <path d="M18,0 C26.2122341,1.04264423e-15 32.8695652,6.65733111 32.8695652,14.8695652 L32.8695652,36 L3.13043478,36 L3.13043478,14.8695652 C3.13043478,6.65733111 9.78776589,2.43283654e-15 18,0 Z" id="Shape" fill="#CDEEF6"> </path> <polygon id="Shape" fill="#FFD782" points="0 40.6956522 36 40.6956522 36 45.3913043 0 45.3913043"> </polygon> <polygon id="Shape" fill="#F9BB4B" points="1.56521739 36 34.4347826 36 34.4347826 40.6956522 1.56521739 40.6956522"> </polygon> <path d="M7.04347826,9.39130435 L11.7391304,9.39130435 C15.1969132,9.39130435 18,12.1943911 18,15.6521739 L18,17.2173913 L13.3043478,17.2173913 C9.84656504,17.2173913 7.04347826,14.4143045 7.04347826,10.9565217 L7.04347826,9.39130435 Z" id="Shape" fill="#8EC13F"> </path> <polygon id="Shape" fill="#C8D952" transform="translate(14.484456, 14.876043) rotate(-56.294043) translate(-14.484456, -14.876043) " points="13.7017499 10.6427772 15.2671621 10.6427772 15.2671621 19.1093093 13.7017499 19.1093093"> </polygon> <path d="M24.2608696,10.173913 L28.9565217,10.173913 L28.9565217,11.7391304 C28.9565217,15.1969132 26.153435,18 22.6956522,18 L18,18 L18,16.4347826 C18,12.9769998 20.8030868,10.173913 24.2608696,10.173913 Z" id="Shape" fill="#55B56A" transform="translate(23.478261, 14.086957) rotate(-180.000000) translate(-23.478261, -14.086957) "> </path> <polygon id="Shape" fill="#C8D952" transform="translate(21.525978, 15.642174) rotate(-33.705957) translate(-21.525978, -15.642174) " points="17.2927117 14.859468 25.7592438 14.859468 25.7592438 16.4248803 17.2927117 16.4248803"> </polygon> <path d="M11.7391304,20.3478261 L14.0869565,20.3478261 C16.2480708,20.3478261 18,22.0997553 18,24.2608696 L18,25.0434783 L15.6521739,25.0434783 C13.4910597,25.0434783 11.7391304,23.291549 11.7391304,21.1304348 L11.7391304,20.3478261 Z" id="Shape" fill="#55B56A"> </path> <path d="M21.9130435,21.1304348 L24.2608696,21.1304348 L24.2608696,21.9130435 C24.2608696,24.0741577 22.5089403,25.826087 20.3478261,25.826087 L18,25.826087 L18,25.0434783 C18,22.882364 19.7519292,21.1304348 21.9130435,21.1304348 Z" id="Shape" fill="#8EC13F" transform="translate(21.130435, 23.478261) rotate(-180.000000) translate(-21.130435, -23.478261) "> </path> <polygon id="Shape" fill="#66342E" points="7.82608696 36 8.60869565 32.8695652 10.9565217 30.5217391 14.0869565 30.5217391 16.4347826 28.9565217 19.5652174 28.9565217 22.6956522 30.5217391 26.6086957 30.5217391 28.9565217 32.0869565 29.7391304 36"> </polygon> <polygon id="Shape" fill="#995F5B" points="15.6521739 32.0869565 17.2173913 32.0869565 17.2173913 33.6521739 15.6521739 33.6521739"> </polygon> <polygon id="Shape" fill="#995F5B" points="20.3478261 32.0869565 21.9130435 32.0869565 21.9130435 33.6521739 20.3478261 33.6521739"> </polygon> <path d="M9.98843478,7.54904348 L8.79417391,6.53791304 C11.044312,3.73760033 14.4977996,2.18203297 18.086087,2.35252174 L17.9162609,3.90834783 C14.8453957,3.79384845 11.9027923,5.14518027 9.98843478,7.54904348 Z" id="Shape" fill="#F4F4E6"> </path> <polygon id="Shape" fill="#F4F4E6" points="5.47826087 16.4347826 7.04347826 16.4347826 7.04347826 28.173913 5.47826087 28.173913"> </polygon> <polygon id="Shape" fill="#F4F4E6" points="5.47826087 29.7391304 7.04347826 29.7391304 7.04347826 31.3043478 5.47826087 31.3043478"> </polygon> <g id="Group" transform="translate(4.695652, 38.347826)" fill="#FFF69A"> <polygon id="Shape" points="0 4.69565217 1.56521739 4.69565217 1.56521739 7.04347826 0 7.04347826"> </polygon> <polygon id="Shape" points="5.47826087 4.69565217 7.04347826 4.69565217 7.04347826 7.04347826 5.47826087 7.04347826"> </polygon> <polygon id="Shape" points="17.2173913 4.69565217 18.7826087 4.69565217 18.7826087 7.04347826 17.2173913 7.04347826"> </polygon> <polygon id="Shape" points="23.4782609 0 25.0434783 0 25.0434783 2.34782609 23.4782609 2.34782609"> </polygon> <polygon id="Shape" points="9.39130435 0 10.9565217 0 10.9565217 2.34782609 9.39130435 2.34782609"> </polygon> </g> <path d="M18.7826087,28.9565217 L17.2173913,28.9565217 L17.2173913,15.6521739 C17.2173913,15.2199511 17.5677772,14.8695652 18,14.8695652 C18.4322228,14.8695652 18.7826087,15.2199511 18.7826087,15.6521739 L18.7826087,28.9565217 Z" id="Shape" fill="#3A8448"> </path> </g> </g> </svg>
  • Andreas Mehlsen
  • MIT
  • 12 просмотров
  • 5 скачиваний