What is a B tree?
Submitted by: AdministratorA B-tree of order m (the maximum number of children for each node) is a tree which satisfies the following properties :
1. Every node has <= m children.
2. Every node (except root and leaves) has >= m/2 children.
3. The root has at least 2 children.
4. All leaves appear in the same level, and carry no information.
5. A non-leaf node with k children contains k - 1 keys
Submitted by: Administrator
1. Every node has <= m children.
2. Every node (except root and leaves) has >= m/2 children.
3. The root has at least 2 children.
4. All leaves appear in the same level, and carry no information.
5. A non-leaf node with k children contains k - 1 keys
Submitted by: Administrator
Read Online Data Structures Trees Job Interview Questions And Answers
Top Data Structures Trees Questions
| ☺ | Explain red-black trees? |
| ☺ | How to find the depth of a binary tree? |
| ☺ | What is threaded binary tree. Explain its common uses? |
| ☺ | Do you know implementation of traversal of a binary tree? |
| ☺ | Explain B+ tree? Explain its uses? |
Top Coding/Programming Categories
| ☺ | Python Interview Questions. |
| ☺ | OOP Interview Questions. |
| ☺ | Software engineering Interview Questions. |
| ☺ | PHP Interview Questions. |
| ☺ | VBA (Visual Basic for Applications) Interview Questions. |
