Browse Prior Art Database

Scan Right to Limit Disclosure Number: IPCOM000059392D
Original Publication Date: 1988-Sep-01
Included in the Prior Art Database: 2005-Feb-16

Publishing Venue


Related People

Woodrum, LJ [+details]


Given a binary tree, where each inner node has a stored value, and each stored value at any inner node I is associated with the leftmost sink node in I's right subtree, and means are present for tracing both down and up the paths in the tree, and there is a single TOP inner node, also having a stored value, which is the smallest value in the tree, and there is a single right-pointing edge from the TOP node to the rest of the tree, and there is a selected edge and a limit L, and it is desired to identify an edge in the tree AB so that B is a sink and the value associated with B is the smallest such value that is greater than or equal to the limit L.