c_cpp 94.二叉树有序遍历 - 难度中等 - 2018.9.7

Posted 2021-05-14

// 递归法：
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
 class Solution {
 public:
     void iTra(TreeNode* root, vector<int>& re) {
         if(root == NULL) return;
         iTra(root->left, re);
         re.insert(re.end(), root->val);
         iTra(root->right, re);
     }
     vector<int> inorderTraversal(TreeNode* root) {
         vector<int> result;
         iTra(root, result);
         return result;
     }
 };