Method InsertBalanced
InsertBalanced(String[], Char[], Int32, Int32)
Recursively insert the median first and then the median of the lower and upper halves, and so on in order to get a balanced tree. The array of keys is assumed to be sorted in ascending order.
Declaration
protected virtual void InsertBalanced(string[] k, char[] v, int offset, int n)Parameters
| Type | Name | Description |
|---|---|---|
| System.String[] | k | |
| System.Char[] | v | |
| System.Int32 | offset | |
| System.Int32 | n |
