Method for balancing binary search trees

Details Method for balancing binary search trees Method for balancing binary search trees

2005-12-13

2008-11-04

Rones, Charles (Department: 2164)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C709S203000

Reexamination Certificate

active

07447698

ABSTRACT:
Method for balancing a binary search tree. A computer implemented method for balancing a binary search tree includes locating a node in a binary search tree, determining whether a depth of the located node is greater than a threshold, and performing balancing operations. If the depth of the located node is greater than the threshold, the balancing operations may include a modified semi-splay balancing procedure. Regardless of depth, localized balancing operations may be performed while locating a node.

REFERENCES:
patent: 5694591 (1997-12-01), Du et al.
patent: 5987468 (1999-11-01), Singh et al.
patent: 6188696 (2001-02-01), Moran et al.
patent: 6229791 (2001-05-01), Nusekabel et al.
patent: 6337862 (2002-01-01), O'Callaghan et al.
patent: 2002/0087564 (2002-07-01), Khanna et al.
patent: 2004/0141509 (2004-07-01), Sahni et al.
“Application Of Splay Trees to Data Compression”, (ACM, vol. 31, No. 8, Aug. 1988), pp. 996-1007, by Douglas W. Jones.
Sleator et al., “Self Adjusting Binary Search Trees”, Journal of the Association for Computing Machinery, vol. 32, No. 3, Jul. 1985, New Jersey, pp. 652-686.

Affiliated with

Also associated with

Rating

Method for balancing binary search trees does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for balancing binary search trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for balancing binary search trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4033480