[LeetCode] Binary Tree Traversal 系列

前言

LeetCode有三道考察二叉树遍历的基础题，即Binary Tree XXXOrder Traversal 系列，分别为Preorder，inorder，以及postorder。
先序，中序，后序遍历都比较简单，下面讨论递归方法。

题目

https://leetcode.com/problems/binary-tree-preorder-traversal/
https://leetcode.com/problems/binary-tree-inorder-traversal/
https://leetcode.com/problems/binary-tree-postorder-traversal/

代码

/**
 * 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:
    vector<int> preorderTraversal(TreeNode* root) {
      vector<int> v;
      preTraversal(root, v);
      return v;
    }

    void preTraversal(TreeNode * root, std::vector<int>& v) {
      if (!root) return;
      v.push_back(root->val);
      preTraversal(root->left, v);
      preTraversal(root->right, v);
    }
};

class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
      vector<int> v;
      inTraversal(root, v);
      return v;
    }

    void inTraversal(TreeNode * root, std::vector<int>& v) {
      if (!root) return;
      inTraversal(root->left, v);
      v.push_back(root->val);
      inTraversal(root->right, v);
    }
};

class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
      vector<int> v;
      postTraversal(root, v);
      return v;
    }

    void postTraversal(TreeNode * root, std::vector<int>& v) {
      if (!root) return;
      postTraversal(root->left, v);
      postTraversal(root->right, v);
      v.push_back(root->val);
    }
};