Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUST916004 I4
Publication typeGrant
Publication dateNov 27, 1973
Filing dateJan 16, 1973
Priority dateJan 16, 1973
Publication numberUS T916004 I4, US T916004I4, US-I4-T916004, UST916004 I4, UST916004I4
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Data tree structure and maintenance method
US T916004 I4
Abstract  available in
Images(4)
Previous page
Next page
Claims  available in
Description  (OCR text may contain errors)

A DEFENSIVE PUBLICATION UNITED STATES PATENT OFFICE Published at the request of the applicant or owner in accordance with the Notice of Dec. 16, 1969, 869 0.6. 687. The abstracts of Defensive Publication applications are identified by distinctly numbered series and are arranged chronologically. The heading of each abstract indicates the number of pages of specification, including claims and sheets of drawings contained in the application as originally filed. The files of these applications are available to the public for inspection and reproduction may be purchased for 30 cents a sheet.

Defensive Publication applications have not been examined as to the merits of alleged invention. The Patent Oifice makes no assertion as to the novelty of the disclosed subject matter.

PUBLISHED NOVEMBER 27, 1973 mmwm A 2 log binary tree data set structure where the null height of the nodes in any path is non-increasing, and where in any path there are not more than two nodes at the same null height. Also, the method for adding to and deleting nodes from a 2 log binary tree so that the resulting structure is also a 2 log tree.

NEW. 27, 1973 v I w CONNER A T9l6,004

DATA TREE STRUCTURE AND MAINTENANCE METHOD Original Filed Dec. 27, 1971 4 Sheets-Sheet Y 21 31 4Y 51 61 ADDRESS KEY L LINK R LINK HT H ROOT A KEY =E KEY Y W 2s 55 45 55 65 ADDRESS KEY LLINK RLlNK HT ADDRESS KEY LLINK RLINK HT =AKEY =A =\NULL =NULL =E KEY =E =CKEY =EKEY =Y 44 /Y ADDRESS KEY LLYNK RLINK HT ADDRESS KEY LLINK RLINK HT '=cKEY =c =NULL =DKEY =FKEY =F =NULL =.NULL =0 45 e 1 ADDRESS KEY L LINK R LINK HT =DKEY =0 =NULL =NULL =0' FIG. 1A

FIGZA 001a omem FIG. 3A F|G.3B FIG. 3C

Nov. 27, 1973 w. M. CONNER M T9169 DATA TREE STRUCTURE AND MAINTENANCE METHOD Original Filed Dec. 27, 1971 I 4 Sheets-Sheet 2 P+R L|NK(P) M L|NK(P) EXIT: FIG. 5

START l P+ ROOT YES T -EMPTY STEP 2 PUSH P 0mm P+L L!NK(P) P+RLINK(P) Nov. 27, 1973 Original Filed Dec. 27, 1971 W. M. CONNER ll DATA TREE STRUCTURE AND MAINTENANCE METHOD STEPT STEP?) YES RLINK(N)+S P+DEEPEST HT H NODE INT 4 Sheets-Sheet 3 R LINK(P) LLINK(Q) SWAP 0&N

Nov. 21, 1973 v w. M. CONNER u T916,004

DATA TREE STRUCTURE AND MAINTENANCE METHOD Original Filed Deo. 2'7, 1971 4 Sheets-Sheet STEP 2 FIG. 8

LLINK (P)+N EXIT FIGHA FIGHB

Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US5557786 *Jan 24, 1994Sep 17, 1996Advanced Computer Applications, Inc.Threaded, height-balanced binary tree data structure
Classifications
U.S. Classification707/797, 707/999.1
International ClassificationG06F17/30
Cooperative ClassificationG06F17/30961
European ClassificationG06F17/30Z1T