ON FINDING THE HEIGHT OF A BINARY SEARCH TREE

Edit Your Profile

ON FINDING THE HEIGHT OF A BINARY SEARCH TREE Note

WEISS, MA. (1993). ON FINDING THE HEIGHT OF A BINARY SEARCH TREE . COMPUTER JOURNAL, 36(3), 280-281. 10.1093/comjnl/36.3.280

Open Access

cited authors

WEISS, MA

authors

Weiss, Mark Allen

publication date

January 1, 1993

webpage

https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:A1993LB08100008&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=e451fd656366bf1ec5554941920a9ccb

published in

COMPUTER JOURNAL Journal

keywords

Computer Science
Computer Science, Hardware & Architecture
Computer Science, Information Systems
Computer Science, Software Engineering
Computer Science, Theory & Methods
Science & Technology
Technology

Digital Object Identifier (DOI)

https://doi.org/10.1093/comjnl/36.3.280

publisher

CAMBRIDGE UNIV PRESS

start page

280

end page

281

volume

36

issue

3