D
Question 11
A binary search tree (BST) is a linked-node based binary tree which stores key-value
pairs (or just keys) in each node.
Find/Search/Get in a binary search tree with n nodes has an expected runtime
of O(log n) for balanced trees.
O True
1 pts
False