{"type":"rich","version":"1.0","provider_name":"Transistor","provider_url":"https://transistor.fm","author_name":"Programming Tech Brief By HackerNoon","title":"Augmented Tree Data Structures","html":"<iframe width=\"100%\" height=\"180\" frameborder=\"no\" scrolling=\"no\" seamless src=\"https://share.transistor.fm/e/f95a897b\"></iframe>","width":"100%","height":180,"duration":1435,"description":"\n        This story was originally published on HackerNoon at: https://hackernoon.com/augmented-tree-data-structures.\nData structures are a serious tool to store data conveniently. Modern applications have the flexibility to organize the data in the memory or on disk using vari\nCheck more stories related to programming at: https://hackernoon.com/c/programming.\n            You can also check exclusive content about #data-structures, #binary-tree, #memory-management, #augmented-tree-data-structures, #key-value-associative-arrays, #efficient-sorting, #multi-key-data-structures,  and more.\nThis story was written by: @amoshi. Learn more about this writer by checking @amoshi's about page,\n            and for more stories, please visit hackernoon.com.\nData structures are a serious tool to store data conveniently. Modern applications have the flexibility to organize the data in the memory or on disk using various methods. Some augmentations can improve applications performance, other - compress the data stored in the memory.","thumbnail_url":"https://img.transistorcdn.com/KhCapPSRkLGL2Xw8888yuChkNRWthaKapLYTvNdu4W4/rs:fill:0:0:1/w:400/h:400/q:60/mb:500000/aHR0cHM6Ly9pbWct/dXBsb2FkLXByb2R1/Y3Rpb24udHJhbnNp/c3Rvci5mbS9zaG93/LzQxMTY2LzE2ODM1/ODIzMzAtYXJ0d29y/ay5qcGc.webp","thumbnail_width":300,"thumbnail_height":300}