{"id":"https://openalex.org/W2012461315","doi":"https://doi.org/10.1002/spe.4380111207","title":"Generalized non\u2010recursive traversal of binary trees","display_name":"Generalized non\u2010recursive traversal of binary trees","publication_year":1981,"publication_date":"1981-12-01","ids":{"openalex":"https://openalex.org/W2012461315","doi":"https://doi.org/10.1002/spe.4380111207","mag":"2012461315"},"language":"en","primary_location":{"id":"doi:10.1002/spe.4380111207","is_oa":false,"landing_page_url":"https://doi.org/10.1002/spe.4380111207","pdf_url":null,"source":{"id":"https://openalex.org/S122199241","display_name":"Software Practice and Experience","issn_l":"0038-0644","issn":["0038-0644","1097-024X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Software: Practice and Experience","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/A5070452633","display_name":"Alistair Kilgour","orcid":null},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"A. C. Kilgour","raw_affiliation_strings":["Computing Science Department University of Glasgow, Glasgow G12 8QQ, U.K"],"affiliations":[{"raw_affiliation_string":"Computing Science Department University of Glasgow, Glasgow G12 8QQ, U.K","institution_ids":["https://openalex.org/I7882870"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070452633"],"corresponding_institution_ids":["https://openalex.org/I7882870"],"apc_list":{"value":4220,"currency":"USD","value_usd":4220},"apc_paid":null,"fwci":1.0869,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79871912,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"12","first_page":"1299","last_page":"1306"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.8324000239372253,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.8324000239372253,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.8080999851226807,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T13126","display_name":"Scientific Research and Discoveries","score":0.7684999704360962,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.8944333791732788},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.6779506206512451},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6616355180740356},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6533921957015991},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5535795092582703},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.532254159450531},{"id":"https://openalex.org/keywords/pascal","display_name":"Pascal (unit)","score":0.5022602081298828},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.49852418899536133},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4885202646255493},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.4634886085987091},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4417906105518341},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.377867728471756},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31425172090530396},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.24438327550888062},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16763702034950256}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8944333791732788},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.6779506206512451},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6616355180740356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6533921957015991},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5535795092582703},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.532254159450531},{"id":"https://openalex.org/C75608658","wikidata":"https://www.wikidata.org/wiki/Q44395","display_name":"Pascal (unit)","level":2,"score":0.5022602081298828},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.49852418899536133},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4885202646255493},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.4634886085987091},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4417906105518341},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.377867728471756},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31425172090530396},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.24438327550888062},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16763702034950256},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/spe.4380111207","is_oa":false,"landing_page_url":"https://doi.org/10.1002/spe.4380111207","pdf_url":null,"source":{"id":"https://openalex.org/S122199241","display_name":"Software Practice and Experience","issn_l":"0038-0644","issn":["0038-0644","1097-024X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Software: Practice and Experience","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1982839286","https://openalex.org/W1993449345","https://openalex.org/W2027952317","https://openalex.org/W2045594573","https://openalex.org/W2061505799","https://openalex.org/W2071455557","https://openalex.org/W2752853835"],"related_works":["https://openalex.org/W2056975861","https://openalex.org/W2367083125","https://openalex.org/W1510719821","https://openalex.org/W2371680642","https://openalex.org/W1998170879","https://openalex.org/W2571039174","https://openalex.org/W2181425632","https://openalex.org/W2116714544","https://openalex.org/W151008969","https://openalex.org/W2084361809"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"non\u2010recursive":[2],"algorithm":[3,40,67,91],"for":[4],"the":[5,15,29,39,72,95],"traversal":[6,18],"of":[7,17,28,71,76,85,99],"a":[8,69,86],"binary":[9],"tree":[10],"is":[11,19,64,68,81,92],"presented":[12],"in":[13],"which":[14],"order":[16],"defined":[20],"by":[21,83],"an":[22,61],"external":[23],"data":[24],"array,":[25],"allowing":[26],"any":[27],"six":[30],"possible":[31],"orders":[32],"to":[33,38],"be":[34],"selected":[35],"without":[36],"modification":[37],"itself.":[41],"The":[42,66,90],"extra":[43],"storage":[44],"requirements":[45],"are":[46],"three":[47],"pointer":[48,73],"variables":[49],"and":[50,78,80,97],"two":[51,56],"bits":[52,57],"per":[53,58],"node":[54],"(or":[55],"level":[59],"if":[60],"auxiliary":[62],"stack":[63],"used.)":[65],"generalization":[70],"reversal":[74],"method":[75],"Schorr":[77],"Waite":[79],"derived":[82],"transformation":[84],"generalized":[87],"recursive":[88],"version.":[89],"described":[93],"using":[94],"notation":[96],"conventions":[98],"Pascal.":[100]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}