Write a short note on B-Tree

5.2kviews

written 8.0 years ago by

teamques10 ★ 65k

modified 19 months ago by

yashbeer ★ 11k

data structures and algorithms

ADD COMMENT EDIT

2 Answers

38views

written 8.0 years ago by

teamques10 ★ 65k

Introduction:

The number of values that a particular node of a binary tree or an AVL tree can hold is 1.

The height of a tree needs to be reduced to increase the efficiency of operations.

Also, when the data is stored in secondary medium, the time required to access …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT

7views

written 19 months ago by

yashbeer ★ 11k

B Tree - A search tree of order P is a tree such that each node contains almost P - 1 search values and P points in the order < P1, K1, P2, K2 .... Pq + +kq-1 , pq > where q < = p

Each P1 is pointer …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.