IF btree is of order n,then what is min nuber of values at each node
Is it floor(n/2)
a
I read if oreder is 5 then min values in each node is 2...SO is it
floor(n/2)
--
Plz anyone write program in C++ and C of searching,inserting and
deleting node in or from a B-tree...
Vijay..
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To uns
sorry i didnt see it ..
On Thu, Jul 15, 2010 at 4:18 AM, jalaj jaiswal wrote:
> its b tree not binary tree
>
>
> On Wed, Jul 14, 2010 at 10:45 AM, naveen wrote:
>
>> if I do two traversals of a tree inorder wise i can get it in O(n).
>> Questions should be one traversal i think . Then we should
its b tree not binary tree
On Wed, Jul 14, 2010 at 10:45 AM, naveen wrote:
> if I do two traversals of a tree inorder wise i can get it in O(n).
> Questions should be one traversal i think . Then we should use a tree where
> nodes contain links to parents.
>
>
> On Tue, Jul 13, 2010 at 6:58 PM,
if I do two traversals of a tree inorder wise i can get it in O(n).
Questions should be one traversal i think . Then we should use a tree where
nodes contain links to parents.
On Tue, Jul 13, 2010 at 6:58 PM, sharad kumar wrote:
> Find the median in B-tree of order n
>
> --
> You received this me
Find the median in B-tree of order n
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For m
Find the median in B-tree of order 4? Note that as the tree has order 4, it
is not a binary tree.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group,
