What is the time complexity of inorder traversal in a binary tree?

The time complexity of inorder traversal in a binary tree is O(n), where n is the number of nodes in the tree.