How to build a B-Tree (B-tree)?

P

polufrukt2019-06-12 21:11:55

Algorithms

polufrukt, 2019-06-12 21:11:55

Good afternoon, given
n=3 (there must be a tree of order 3)
input data:
47;29;68;11;7;13;25;44;121;1;15;20;28;77;112;114;500 ;600;400;200;800;850;650;350;12;17;108;801;811;105
Help visualize :)

Reply

Answer the question

In order to leave comments, you need to log in

0 answer(s)

Similar questions

I

IgorSold2017-07-06 13:17:12

Encoding error when authorizing via wordpress social login, how to fix? 5Reply

C

cybran242019-03-24 14:46:01

Fastest algorithm to find the largest value in an unsorted array? 2Reply

V

VadymB2014-10-28 20:10:53

How do the input parameters affect the predictive model? 2Reply

D

Dena12016-10-27 10:19:53

How to learn to program, both literally and figuratively? 1Reply

Z

Zakhar Orlov2014-10-29 20:21:22

How to do a zigzag traversal of a square matrix in python? 2Reply

Didn't find what you were looking for?

Ask your question