Copyright © 2026 Kotomora. All Rights Reserved.
二分探索木 (nibuntansakugi) Japanese meaning | Kotomora
Report an issue with this page
検けん
索さく
が
効こう
率りつ
的てき
に
行おこな
え
ます
。
Using a binary search tree allows efficient data searching.
This algorithm implements the insertion operation for a binary search tree.
Kanji 二 two, two radical (no. 7) 分 part, minute of time, segment Related words 二に 分ぶん 木ぎ 二分木 (binary tree) is a more general tree structure where each node has at most two children, without the ordering property of a binary search tree.
平へい 衡こう 二に 分ぶん 探たん 索さく 木ぎ 平衡二分探索木 (balanced binary search tree) is a binary search tree that automatically keeps its height small to ensure efficient operations.
Etymology Compound of 二分 (binary division) + 探索 (search) + 木 (tree), a direct calque of the English term 'binary search tree'.
索さく
木ぎ
