What is the time complexity for.Finding the height of the binary tree?
Answers
Answered by
2
Explanation:
Searching in a BST has O(h) worst-case runtime complexity, where h is the height of the tree. .
Mark as Brainliest
Answered by
0
Explanation:
Where h is height of tree in BST
Similar questions