Perfect binary tree

#1

What is the worst case complexity for performing any operation on a perfect binary tree ? O(n) or O(log n) ?

#2

hello @nidhigupta847

it depends on the operation/algorithm that we want to perform (ex-> traversal will always be O(n) ) .

one thing that i can comment is height of perfect binary tree will never exceed log(n) .