Computer Science, asked by ansarif2462, 1 year ago

What is a balanced tree in data structures?

Answers

Answered by jayas07

In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children.Unlike self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as discs. It is commonly used in databases and file systems.

jayas07: Yes but no one r my girlfriend only friend and nothing

justinjayshahil: ohu

justinjayshahil: any body who you like the most is??

justinjayshahil: tell me any one of them

jayas07: No one like me and i dont know about this

justinjayshahil: ohh okk

justinjayshahil: if you are there in tic tok app then just go inside it and read the message in inbox

jayas07: Hey i have forgotten my tik tok id

jayas07: U have other social media app like anything

jayas07: ????

Answered by Aashifa1

in Computer Science a B -tree is a self balancing tree data structure that maintains sorted data and allows searches sequential access,insertions and deletions in logarithmic time.the B-tree is a generalization of a binary search tree in that a node can have more than 2 children.

HOPE MY ANSWER HELPS YOU !!!!

*$ THANK YOU! *$

Previous Question

Next Question