binary search tree
A binary search tree is a binary tree
where every node’s left subtree has keys lessthan the node’s key, and every right subtree has keys greater than the node’s key.
| 单词 | BinarySearchTree |
| 释义 | binary search treeA binary search tree is a binary tree |
| 随便看 |
|
数学辞典收录了18232条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。