给出一棵二叉树,返回其中序遍历
您在真实的面试中是否遇到过这个题? Yes
样例
给出二叉树 {1,#,2,3},
1
\
2
/
3
返回 [1,3,2].
递归+非递归:
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/*
* @param root: A Tree
* @return: Inorder in ArrayList which contains node values.
*/
vector<int> inorderTraversal(TreeNode * root) {
// write your code here
vector<int> res;
middle_order_recursive(root, res);
return res;
}
//递归遍历
void middle_order_recursive(TreeNode *Node, vector<int> &vec) {
if(Node != NULL) {
middle_order_recursive(Node->left, vec);
vec.push_back(Node->val);
middle_order_recursive(Node->right, vec);
}
}
//非递归遍历
void middle_order_non_recursive(TreeNode *Node, vector<int> &vec) {
stack<TreeNode *> sstack;
TreeNode *p;
p = Node;
while(p != NULL || !sstack.empty())
{
while(p != NULL )
{
sstack.push(p);
p = p->left;
}
if(!sstack.empty())
{
p = sstack.top();
vec.push_back(p->val);
sstack.pop();
p = p->right;
}
}
}
};