A BST has n nodes and a height of h. Which of the following holds?
二叉搜索树的高度h和节点个数n满足关系
Ah=O(1)
Bh=O(lgn)
Ch=O(n)
Dh=O(nlgn)
A BST has n nodes and a height of h. Which of the following holds?
二叉搜索树的高度h和节点个数n满足关系
Ah=O(1)
Bh=O(lgn)
Ch=O(n)
Dh=O(nlgn)
Copyright © 2020 www.daanwo.com All Rights Reserved |