{"id":"https://openalex.org/W2148126138","doi":"https://doi.org/10.1080/00207160008804973","title":"Constructing a binary tree efficiently from its traversals","display_name":"Constructing a binary tree efficiently from its traversals","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2148126138","doi":"https://doi.org/10.1080/00207160008804973","mag":"2148126138"},"language":"en","primary_location":{"id":"doi:10.1080/00207160008804973","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160008804973","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032187360","display_name":"Erkki M\u00e4kinen","orcid":"https://orcid.org/0000-0003-1228-9297"},"institutions":[{"id":"https://openalex.org/I4210133110","display_name":"Tampere University","ror":null,"country_code":"FI","type":null,"lineage":["https://openalex.org/I4210133110"]},{"id":"https://openalex.org/I166825849","display_name":"Tampere University","ror":"https://ror.org/033003e23","country_code":"FI","type":"education","lineage":["https://openalex.org/I166825849"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Erkki M\u00e4kinen","raw_affiliation_strings":["Department of Computer Science , University of Tampere , P.O. Box 607, Tampere, FIN, 33101, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , University of Tampere , P.O. Box 607, Tampere, FIN, 33101, Finland","institution_ids":["https://openalex.org/I166825849","https://openalex.org/I4210133110"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032187360"],"corresponding_institution_ids":["https://openalex.org/I166825849","https://openalex.org/I4210133110"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.233402,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"75","issue":"2","first_page":"143","last_page":"147"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9722999930381775,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9610999822616577,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/preorder","display_name":"Preorder","score":0.9352231025695801},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.7081118226051331},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6309117078781128},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5965646505355835},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5945540070533752},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5249274373054504},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5160843729972839},{"id":"https://openalex.org/keywords/de-facto","display_name":"De facto","score":0.48439985513687134},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.44528666138648987},{"id":"https://openalex.org/keywords/binary-expression-tree","display_name":"Binary expression tree","score":0.43429821729660034},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3566227853298187},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2757658362388611},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2345922589302063},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.16283166408538818}],"concepts":[{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.9352231025695801},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.7081118226051331},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6309117078781128},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5965646505355835},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5945540070533752},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5249274373054504},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5160843729972839},{"id":"https://openalex.org/C2992317946","wikidata":"https://www.wikidata.org/wiki/Q712144","display_name":"De facto","level":2,"score":0.48439985513687134},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.44528666138648987},{"id":"https://openalex.org/C166055160","wikidata":"https://www.wikidata.org/wiki/Q4913895","display_name":"Binary expression tree","level":3,"score":0.43429821729660034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3566227853298187},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2757658362388611},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2345922589302063},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.16283166408538818},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/00207160008804973","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160008804973","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.260","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.260","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.uta.fi/pub/reports/A-1998-5.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2013420217","https://openalex.org/W2087628381","https://openalex.org/W2752853835","https://openalex.org/W3193910562"],"related_works":["https://openalex.org/W4232709447","https://openalex.org/W2368829703","https://openalex.org/W2788331025","https://openalex.org/W2388468323","https://openalex.org/W2077383771","https://openalex.org/W1510719821","https://openalex.org/W3022865202","https://openalex.org/W2366139181","https://openalex.org/W1994859311","https://openalex.org/W2069429040"],"abstract_inverted_index":{"In":[0],"this":[1],"note":[2],"we":[3],"streamline":[4],"an":[5],"earlier":[6,27],"algorithm":[7,21],"for":[8],"constructing":[9],"a":[10,34],"binary":[11],"tree":[12],"from":[13],"its":[14,30],"inorder":[15],"and":[16,29],"preorder":[17],"traversals.":[18],"The":[19],"new":[20],"is":[22],"conceptually":[23],"simpler":[24],"than":[25],"the":[26],"algorithms":[28],"time":[31],"complexity":[32],"has":[33],"smaller":[35],"constant":[36],"facto.":[37]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-14T08:36:36.166977","created_date":"2025-10-10T00:00:00"}