avl_tree
Build a self-balancing AVL tree from a list of keys and get the inorder traversal, tree height, and optional key search results for balanced search validation.
Instructions
Build an AVL (self-balancing BST) from a list of keys. Returns inorder traversal, tree height, and optional key search results.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"keys": "<keys>"
},
"name": "avl_tree"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| keys | Yes | Keys to insert into the AVL tree | |
| search_keys | No | Optional keys to search for in the tree |