##### Asked by: Mariko Chapman

asked in category: General Last Updated: 13th May, 2020# How do you insert an AB tree?

**To insert value X into a B-tree, there are 3 steps:**

- using the SEARCH procedure for M-way
**trees**(described above) find the leaf node to which X should be added. - add X to this node in the appropriate place among the values already there.
- if there are M-1 or fewer values in the node after
**adding**X, then we are finished.

In this manner, what is B tree example?

**B**-**Tree** is a self-balanced search **tree** in which every node contains multiple keys and has more than two children. Here, the number of keys in a node and number of children for a node depends on the order of **B**-**Tree**. Every **B**-**Tree** has an order.

Also, what are B trees used for? A **B**-**tree** is a **tree** data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. Unlike self-balancing binary search **trees**, it is optimized for systems that read and write large blocks of data. It is most commonly **used** in database and file systems.

Also to know is, what is AB Tree explain with example?

**A B**-**tree** is a method of placing and locating files (called records or keys) in a database. (The meaning of the letter B has not been explicitly **defined**.) B-**trees** save time by using nodes with many branches (called children), compared with binary **trees**, in which each node has only two children.

What is the difference between B tree and binary tree?

The **difference between** the **B**-**tree** and the **binary tree** is that **B**-**tree** must have all of its child nodes on the same level whereas **binary tree** does not have such constraint. A **binary tree** can have maximum 2 sub-**trees** or nodes whereas in **B**-**tree** can have M no of sub-**trees** or nodes where M is the order of the **B**-**tree**.