首页 > 代码库 > [LeetCode] Binary Tree Inorder Traversal
[LeetCode] Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes‘ values.
For example: Given binary tree {1,#,2,3},
1 2 / 3
return [1,3,2].
Note: Recursive solution is trivial, could you do it iteratively?
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: vector<int> inorderTraversal(TreeNode *root) { vector<int> res; TreeNode *p = root; stack<TreeNode*> s; while(p!=NULL || !s.empty()){ while(p!=NULL){ s.push(p); p=p->left; }//end while if(!s.empty()){ p = s.top(); s.pop(); res.push_back(p->val) ;//刚开始定义res时，它是空的，则不能使用下标操作，只能有push_back()添加新元素 p = p->right; }//end while }//end while return res; }};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。