每道题的方法:
最后总结写
题目一链接:144. 二叉树的前序遍历 - 力扣(LeetCode)
思路:利用递归来遍历二叉树里的所有节点,并按顺序把节点的值存入到vec数组中。
代码:
/**
* 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 travel(TreeNode* cur,vector<int>& vec) {
if(cur == nullptr) return;
vec.push_back(cur -> val);
travel(cur -> left,vec);
travel(cur -> right,vec);
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> result;
travel(root,result);
return result;
}
};
难点:
题目二链接:145. 二叉树的后序遍历 - 力扣(LeetCode)
思路:同上
代码:
/**
* 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 travel(TreeNode* cur,vector<int>& vec) {
if(cur == nullptr) return;
travel(cur -> left,vec);
travel(cur -> right,vec);
vec.push_back(cur -> val);
}
vector<int> postorderTraversal(TreeNode* root) {
vector<int> result;
travel(root,result);
return result;
}
};
难点:
题目三链接:94. 二叉树的中序遍历 - 力扣(LeetCode)
思路:同上
代码:
/**
* 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 travel(TreeNode* cur,vector<int>& vec) {
if(cur == nullptr) return;
travel(cur -> left,vec);//左
vec.push_back(cur -> val);//中
travel(cur -> right,vec);//右
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int> result;
travel(root,result);
return result;
}
};