Register

B tree problem

733 views
1 votes
1 votes

How many new nodes will be formed if we insert a key “i” into below B tree of order “3”?

  1.   1
  2.   2
  3.   3
  4.   4
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
2
pankaj_vir asked Mar 19, 2018
2,079 views
Minimum Spanning Tree Problem
User Avatar
1 votes
1 votes
0 answers
3
Na462 asked Feb 19, 2018
625 views
Minimum Spanning Tree Problem
Given a graph with positive and distinct edge weights. If I double or triple.. the edge weights then:- 1. Shortest path will remain same 2. Mst will remain same Right? Note : Here i am doubling or tripling or four times ..... not increasing by +c
Given a graph with positive and distinct edge weights. If I double or triple.. the edge weights then:- 1. Shortest path will remain same2. Mst will remain sameRight?Note ...
User Avatar
0 votes
0 votes
1 answer
4
mohit kumar 5 asked Aug 18, 2017
738 views
binary tree problem
11. A binary tree has n leaf nodes. The no. of nodes of degree 2 in this tree is: (a) log2n (b) n-1 (c) n (d) 2n
11. A binary tree has n leaf nodes. The no. of nodes of degree 2 in this tree is:(a) log2n (b) n-1 (c) n (d) 2n
User Avatar
Link Copied!