how does it has time complexity of o(n) and not o(nlogn)
i googled it but cant understand it
Morris method for inorder binary tree
A n-node binary tree has n-1 edges. In a Morris traversal, one edge is visited at most 3 times. 1st visit is for locating a node. 2nd visit is for looking for the predecessor of some node. And 3rd/final is for restoring the right child of the predecessor to null.
All these steps take O(n) time . So total time complexity is O(n+n+n)=O(3n) ,since 3 is a constant so we say that the time complexity of the same is O(n).