Telerik UI for WinForms

RBOrderedTreeT Methods |

The RBOrderedTreeT generic type exposes the following members.

Methods

Name | Description | |
---|---|---|

Add |
Add new key into the tree
This operation is O(logN) operation
(Inherited from RBTreeBaseT, N, P.) | |

AddOrGet |
Add new key into the tree or get existing node
This operation is O(logN) operation
(Inherited from RBTreeBaseT, N, P.) | |

Balance |
Balance tree past inserting
(Inherited from RBTreeBaseT, N, P.) | |

Clear |
Remove all items
(Inherited from RBTreeBaseT, N, P.) | |

Delete |
Delete the node z, and free up the space
(Inherited from RBTreeBaseT, N, P.) | |

DeleteFix |
Restore the reb-black properties after a delete
(Inherited from RBTreeBaseT, N, P.) | |

Find |
Find key in the dictionary
This operation is O(logN) operation
(Inherited from RBTreeBaseT, N, P.) | |

First |
Get first node
This operation is O(logN) operation
(Inherited from RBTreeBaseT, N, P.) | |

GetByOrder |
Get item by order index
This operation is O(logN) operation
(Inherited from RBOrderedTreeBaseT.) | |

GetOrder |
Get order index of item
This operation is O(logN) operation
(Inherited from RBOrderedTreeBaseT.) | |

Last |
Get last node
This operation is O(logN) operation
(Inherited from RBTreeBaseT, N, P.) | |

LeftRotate |
Rotate our tree Left
X rb_left_rotate(X)---> Y
/ \ / \
A Y X C
/ \ / \
B C A B
N.B. This does not change the ordering.
We assume that neither X or Y is NULL
(Inherited from RBTreeBaseT, N, P.) | |

NewNode |
Create new node
(Inherited from RBOrderedTreeBaseT.) | |

Next |
Get next node
This operation is O(logN) operation
(Inherited from RBTreeBaseT, N, P.) | |

Predecessor |
Return a pointer to the largest key smaller than x
(Inherited from RBTreeBaseT, N, P.) | |

Previous |
Get previous node
This operation is O(logN) operation
(Inherited from RBTreeBaseT, N, P.) | |

Remove(N) |
Remove node from the dictionary
This operation is O(1) operation
(Inherited from RBTreeBaseT, N, P.) | |

Remove(T) |
Remove key from the dictionary
This operation is O(logN) operation
(Inherited from RBTreeBaseT, N, P.) | |

RightRotate |
Rotate our tree Right
X Y
/ \ / \
A Y leftArrow--rb_right_rotate(Y) X C
/ \ / \
B C A B
N.B. This does not change the ordering.
We assume that neither X or Y is NULL
(Inherited from RBTreeBaseT, N, P.) | |

Successor |
Return a pointer to the smallest key greater than x
(Inherited from RBTreeBaseT, N, P.) |

See Also