AVL tree
(computer science) A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one.
(sometimes attributive) Something that resembles the Pokémon Jigglypuff, e.g. by being rotund, bright pink, or able to induce sleep.
plural of through and through
To stop or slow rotation.
対数検索時間を保証するために、挿入と削除のたびに自動で再平衡される自己平衡二分探索木を実装しました。
Don't have an account? Sign up
Do you have an account? Login
DiQt
Free
★★★★★★★★★★
