[LeetCode] PreOrder,Inorder,PostOrder Traversal Tree

来源：互联网发布：毛少将知乎编辑：程序博客网时间：2024/05/22 05:47

PreOrder: root->left->right

InOrder: left->root->right

PostOrder: left->right->root

PreOrder

class Solution {public: void preorder(TreeNode *root, vector<int> &result) { result.push_back(root->val); if(root->left != NULL) preorder(root->left, result); if(root->right != NULL) preorder(root->right, result); } vector<int> preorderTraversal(TreeNode *root) { vector<int> result; if(root == NULL) return result; preorder(root, result); return result; }};</int></int></int>

Inorder

class Solution {public: void inorder(TreeNode *root, vector<int> &result) { if(root == NULL) return; inorder(root->left, result); result.push_back(root->val); inorder(root->right,result); } vector<int> inorderTraversal(TreeNode *root) { vector<int> result; inorder(root, result); return result; }};</int></int></int>

PostOrder

class Solution {public: void postorder(TreeNode *root, vector<int> &result) { if(root == NULL)return; postorder(root->left, result); postorder(root->right, result); result.push_back(root->val); } vector<int> postorderTraversal(TreeNode *root) { vector<int> result; postorder(root,result); return result; }};</int></int></int>

0 0