{"id":"https://openalex.org/keywords/balanced-trees","display_name":"balanced trees","description":"Balanced trees are search-tree data structures that maintain bounded differences in subtree heights or sizes for efficient operations.","display_name_alternatives":["balanced tree","self-balancing tree","self-balancing trees","self-balancing search trees","balanced search tree"],"ids":{"openalex":"https://openalex.org/keywords/balanced-trees","wikidata":"https://www.wikidata.org/wiki/Q29791656"},"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.436,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.436,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":686,"cited_by_count":13916,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/balanced-trees","updated_date":"2026-11-16T04:05:30","created_date":"2026-09-30T00:00:00"}
