Loading...
Engaged Employer
What is the lookup complexity of a binary tree?
Anonymous
O(N). Note that a binary search tree can do a O(log(N)) lookup since the data is sorted in a BST, but not necessarily true in a BT.
Check out your Company Bowl for anonymous work chats.
Get actionable career advice tailored to you by joining more bowls.
Stay ahead in opportunities and insider tips by following your dream companies.
Get personalized job recommendations and updates by starting your searches.