edited by
528 views
3 votes
3 votes

edited by

Please log in or register to answer this question.

Related questions

4 votes
4 votes
1 answer
1
shivani2010 asked Jun 9, 2016
1,102 views
The amortized time complexity to perform ______ operation(s) in Splay trees is $O(\log n)$.SearchSearch and Insert Search and DeleteSearch, insert and delete
0 votes
0 votes
2 answers
2
sripo asked Dec 25, 2018
4,673 views
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?Does it vary for binary tree?What do you mean by internal nodes? Non roo...
1 votes
1 votes
1 answer
3
casberg asked Nov 23, 2021
497 views
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560127 & 21866561 & 255255 & 2186
1 votes
1 votes
1 answer
4
kd..... asked Apr 13, 2019
755 views
here what to do first as FIZZA and IMRAN both are unbalanced than either to do RR rotation from FIZZA-IMRAN-NAVEEN or RL rotation from IMRAN-NAVEEN-LOVELY