{"id":"https://openalex.org/keywords/huffman-tree","display_name":"Huffman tree","description":"A binary tree used in data compression to construct prefix codes with efficient symbol encoding.","display_name_alternatives":["Huffman trees","Huffman coding tree","Huffman code tree","Huffman encoding tree"],"ids":{"openalex":"https://openalex.org/keywords/huffman-tree","wikidata":null},"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.4394,"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.4394,"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":211,"cited_by_count":1942,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/huffman-tree","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
