144. 二叉树的前序遍历
class Solution
{
private:
vector<int> v;
public:
void traversal(TreeNode* root)
{
if (root == nullptr)
{
return;
}
v.push_back(root->val);
traversal(root->left);
traversal(root->right);
}
vector<int> preorderTraversal(TreeNode* root)
{
traversal(root);
return v;
}
};
94. 二叉树的中序遍历
class Solution
{
private:
vector<int> v;
void traversal(TreeNode* root)
{
if (root == nullptr)
{
return;
}
traversal(root->left);
v.push_back(root->val);
traversal(root->right);
}
public:
vector<int> inorderTraversal(TreeNode* root)
{
traversal(root);
return v;
}
};
145. 二叉树的后序遍历
class Solution
{
private:
vector<int> v;
void traversal(TreeNode* root)
{
if (root == nullptr)
{
return;
}
traversal(root->left);
traversal(root->right);
v.push_back(root->val);
}
public:
vector<int> postorderTraversal(TreeNode* root)
{
traversal(root);
return v;
}
};
102. 二叉树的层序遍历
class Solution
{
public:
vector<vector<int>> levelOrder(TreeNode* root)
{
vector<vector<int>> ans;
if (root == nullptr)
{
return ans;
}
queue<TreeNode*> q;
q.push(root);
ans.push_back({ root->val });
while (!q.empty())
{
vector<int> value;
auto n{ q.size() };
for (int i{}; i < n; i++)
{
auto node{ q.front() };
q.pop();
if (node->left != nullptr)
{
q.push(node->left);
value.push_back(node->left->val);
}
if (node->right != nullptr)
{
q.push(node->right);
value.push_back(node->right->val);
}
}
if (!value.empty())
{
ans.push_back(value);
}
}
return ans;
}
};