Close
Close Window

Foundations of Data Structures and Algorithms

Chapter 7 Week 8: B-Trees and Graph Representations

Show Source |    | About   «  7.6. Indexing Summary Exercises   ::   Contents   ::   7.8. Graphs Chapter Introduction  »

7.7. B-Trees Test

2-3+ Tree Build Example

1 / 28 Settings
<<<>>>

Example 2-3+ Tree Visualization: Insert

Created with Raphaël 2.1.2
Proficient Saving... Error Saving
Server Error
Resubmit

An example of building a 2-3+ tree

2-3+ Tree Search Example

1 / 10 Settings
<<<>>>

Example 2-3+ Tree Visualization: Search

Created with Raphaël 2.1.2
  1. 15
    J
  2. 22
    X
  1. 52
    B
  1. 33
  1. 65
    S
  1. 71
    W
  2. 89
    M
  1. 71
  1. 46
  2. 65
  1. 33
    O
  1. 46
    H
  2. 47
    L
  1. 52
Proficient Saving... Error Saving
Server Error
Resubmit

An example of searching in a 2-3+ tree

2-3+ Tree Delete Example

1 / 33 Settings
<<<>>>

Example 2-3+ Tree Visualization: Delete

Created with Raphaël 2.1.2
  1. 15
    J
  1. 71
    W
  2. 89
    M
  1. 22
  1. 65
    S
  2. 70
    F
  1. 51
    B
  2. 52
    T
  1. 71
  1. 46
  2. 65
  1. 46
    H
  2. 47
    L
  1. 22
    X
  2. 33
    O
  1. 51
Proficient Saving... Error Saving
Server Error
Resubmit

An example of deleting from a 2-3+ tree

Now, let's see examples of higher-order B+ Trees.

First we insert.

1 / 42 Settings
<<<>>>

Example B+ Tree Visualization: Insert into a tree of degree 4

Created with Raphaël 2.1.2
Proficient Saving... Error Saving
Server Error
Resubmit

An example of building a B+ tree

Next, we find.

1 / 10 Settings
<<<>>>

Example B+ Tree Visualization: Search in a tree of degree 4

Created with Raphaël 2.1.2
  1. 10
    S
  2. 18
    E
  1. 40
    Q
  2. 55
    F
  1. 25
  2. 40
  1. 77
    A
  2. 89
    B
  1. 98
    A
  2. 127
    V
  1. 25
    T
  2. 39
    F
  1. 98
  1. 77
Proficient Saving... Error Saving
Server Error
Resubmit

An example of search in a B+ tree

Finally, we delete.

1 / 23 Settings
<<<>>>

Example B+ Tree Visualization: Delete from a tree of degree 4

Created with Raphaël 2.1.2
  1. 5
    F
  2. 10
    S
  1. 44
    Q
  2. 48
    E
  1. 12
  2. 44
  1. 67
    A
  2. 88
    B
  1. 58
    A
  2. 60
    F
  1. 12
    V
  2. 27
    T
  1. 67
  1. 58
Proficient Saving... Error Saving
Server Error
Resubmit

An example of deletion in a B+ tree

Now insert into a tree of degree 5.

1 / 33 Settings
<<<>>>

Example B+ Tree Visualization: Insert into a tree of degree 5

Created with Raphaël 2.1.2
Proficient Saving... Error Saving
Server Error
Resubmit

An example of building a B+ tree of degree 5

   «  7.6. Indexing Summary Exercises   ::   Contents   ::   7.8. Graphs Chapter Introduction  »

nsf
Close Window