Problem Submissions Solution
Inorder Traversal Of Binary Tree
Difficulty: Easy
Acceptance: %
Points: 20.00
In-order traversal first visits the left child (including its entire subtree), then visits the node, and finally visits the right child (including its entire subtree).
Given a Binary Tree, your task is to return its In-Order Traversal.
Examples:
Expected Time Complexity: O(n)
Expected Auxiliary Space: O(log n) for recursive calls + O(n)
Constraints:
- 1 <= number of nodes <= 10^5
- 0 <= node->data <= 10^5
Companies:
Amazon Adobe
Topics:
Tree
