題目：給出一棵二叉樹,返回其中序遍歷

?

/**

?* Definition of TreeNode:
?* class TreeNode {
?* public:
?*???? int val;
?*???? TreeNode *left, *right;
?*???? TreeNode(int val) {
?*???????? this->val = val;
?*???????? this->left = this->right = NULL;
?*???? }
?* }
?*/
class Solution {
??? /**
???? * @param root: The root of binary tree.
???? * @return: Inorder in vector which contains node values.
???? */
public:
??? vector<int> inorderTraversal(TreeNode *root) {
??????? // write your code here
??????? vector<TreeNode *> t;
??????? vector<int> res;
while(root != NULL || t.size() != 0) {
while(root != NULL) {
??????????????? t.push_back(root);
??????????????? root = root->left;
??????????? }
??????????? root = t.back();
??????????? t.pop_back();
??????????? res.push_back(root->val);
??????????? root = root->right;
??????? }
??????? return res;
??? }
};

轉載于:https://www.cnblogs.com/ALIMAI2002/p/7206740.html

總結

以上是生活随笔為你收集整理的1.二叉树的中序遍历的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。