Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences

DOI10.1137/S0097539790189733zbMath0802.68035OpenAlexW2038050724MaRDI QIDQ4286226

Rajamani Sundar, Robert Endre Tarjan

Publication date: 27 March 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539790189733

zbMATH Keywords

programming languagesdata structuresequality testingbinary search treesdictionaryabstract data typeunique representation\(S\)-expressions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Combinatorics in computer science (68R05) Data structures (68P05)

Related Items

Dynamic and internal longest common substring, Longest common substring made fully dynamic, EXPtime tableaux for ALC