递归: 左根右
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} * }; */ class Solution { public: void Inorder(TreeNode* node, vector<int>& v) { if (node == NULL) return ; if (node->left != NULL) Inorder(node->left, v); v.push_back(node->val); if (node->right != NULL) Inorder(node->right, v); } vector<int> inorderTraversal(TreeNode* root) { vector<int> v; Inorder(root, v); return v; } };
标签:node,right,TreeNode,val,中序,二叉树,Inorder,94,left From: https://www.cnblogs.com/hannah00/p/16791712.html