首页 > 代码库 > [leetcode-94-Binary Tree Inorder Traversal]
[leetcode-94-Binary Tree Inorder Traversal]
Given a binary tree, return the inorder traversal of its nodes‘ values.
For example:
Given binary tree [1,null,2,3],
1
\
2
/
3
return [1,3,2].
Note: Recursive solution is trivial, could you do it iteratively?
vector<int> inorderTraversal(TreeNode* root) { vector<int>result; stack<TreeNode*>st; while(root != NULL || !st.empty()) { if(root!= NULL) { st.push(root); root = root->left; } else { root = st.top(); result.push_back(root->val); st.pop(); root = root->right; } } return result; }
[leetcode-94-Binary Tree Inorder Traversal]
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。