Srikanth
BAN USER
Questions (4)
Comments (2)
Followers (1)
Reputation 35
- 1of 1 vote
AnswersA tree-map is implemented using BST, the complexity of search in a tree-map is guaranteed to be O(logn). How is that case of search complexity O(n) [obtained when the BST is like a linked list from the root node, only in single side] in BST avoided in tree-map.
- Srikanth in United States| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Data Structures - 0of 0 votes
AnswersCompare the space complexity of BST and Hash-Table.
- Srikanth in United States| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Data Structures
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Page:
1
Repseinarondal, Applications Developer at ABC TECH SUPPORT
I am Seina, a hardworking individual with many years of customer service experience seeking a position with a company utilizing ...
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
the condition you have missed is that, if right child is not present.. return parent node, else return null.
- Srikanth February 15, 2013