data structures - What is the Big-O complexity of a general tree? -


what mean general tree unbalanced tree multiple child nodes (not restricted 2 child node each branch binary tree). big-o complexity of remove node, insert node, find node

the average time complexity of searching in balanced bst in o(log(n)). worst case complexity of searching in unbalanced binary tree o(n).


Comments

Popular posts from this blog

python - Selenium remoteWebDriver (& SauceLabs) Firefox moseMoveTo action exception -

html - How to custom Bootstrap grid height? -

transpose - Maple isnt executing function but prints function term -