B tree
- From: "maverickcool@xxxxxxxxx" <maverickcool@xxxxxxxxx>
- Date: Wed, 13 Aug 2008 12:58:26 -0700 (PDT)
hi all
i'm learning data structures and i have a question regarding b-trees.
suppose we have 2 B-trees: A and B, both of order m. one has a keys
and the other b keys. we know that all the keys in A are smaller than
the keys in B.
how can we make one B tree of order m out of both of them in
O(log(max(a,b))?
.
- Follow-Ups:
- Re: B tree
- From: Tegiri Nenashi
- Re: B tree
- Prev by Date: Re: Another approach to decide on existence of a real root for Univariate Polynomials with Integer Coefficients, and a possible Multivariate extension for 3-SAT
- Next by Date: This year's Godel Prize
- Previous by thread: Re: Another approach to decide on existence of a real root for Univariate Polynomials with Integer Coefficients, and a possible Multivariate extension for 3-SAT
- Next by thread: Re: B tree
- Index(es):
Relevant Pages
|
