Binary Tree - 1
1. Traversal
1.1 Preorder Traversal
1.1.1 Recursive
/**
* 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 preorderHelper(TreeNode* root, vector<int>& res)
{
if (root == nullptr)
{
return;
}
res.push_back(root->val);
preorderHelper(root->left, res);
preorderHelper(root->right, res);
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> res;
preorderHelper(root, res);
return res;
}
};
1.1.2 Iterative
1.1.2.1 preorder template
/**
* 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:
vector<int> preorderTraversal(TreeNode* root) {
vector<int> res;
if (root == nullptr)
{
return res;
}
stack<TreeNode*> s;
s.push(root);
while (!s.empty())
{
TreeNode* t = s.top();
s.pop();
res.push_back(t->val);
if (t->right) s.push(t->right);
if (t->left) s.push(t->left);
}
return res;
}
};
1.1.2.2 General Template
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<int> res;
if (root == nullptr)
{
return res;
}
stack<TreeNode*> s;
s.push(root);
while (!s.empty())
{
TreeNode* t = s.top();
s.pop();
if (t)
{
if (t->right) s.push(t->right);
if (t->left) s.push(t->left);
s.push(t);
s.push(nullptr); // use nullptr to label it
}
else
{
t = s.top();
s.pop();
res.push_back(t->val);
}
}
return res;
}
};
1.2 Postorder Traversal
1.2.1 Iterative
1.2.1.1 postorder iterative
/**
* 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:
vector<int> postorderTraversal(TreeNode* root) {
vector<int> res;
if (root == nullptr)
{
return res;
}
stack<TreeNode*> stk;
stk.push(root);
while (!stk.empty())
{
TreeNode* t = stk.top();
if (t->left)
{
stk.push(t->left);
t->left = nullptr;
}
else if (t->right)
{
stk.push(t->right);
t->right = nullptr;
}
else
{
res.push_back(t->val);
stk.pop();
}
}
return res;
}
};
1.2.1.2 general template
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
vector<int> res;
if (root == nullptr)
{
return res;
}
stack<TreeNode*> stk;
stk.push(root);
while (!stk.empty())
{
TreeNode* t = stk.top();
stk.pop();
if (t)
{
// left - right - root
stk.push(t);
stk.push(nullptr);
if (t->right) stk.push(t->right);
if (t->left) stk.push(t->left);
}
else
{
t = stk.top();
stk.pop();
res.push_back(t->val);
}
}
return res;
}
};
1.3 Inorder Traversal
1.3.1 Iterative
1.3.1.1 inorder iterative
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
if (root == nullptr)
{
return res;
}
stack<TreeNode*> s;
TreeNode* ptr = root;
while (ptr || !s.empty())
{
if (ptr)
{
s.push(ptr);
ptr = ptr->left;
}
else
{
ptr = s.top();
s.pop();
res.push_back(ptr->val);
ptr = ptr->right;
}
}
return res;
}
};
1.4 Level Order Traversal
/**
* 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:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> res;
if (root == nullptr)
{
return res;
}
queue<TreeNode*> q;
q.push(root);
while (!q.empty())
{
int sz = q.size();
vector<int> v;
for (int i = 0; i < sz; i ++)
{
TreeNode* n = q.front();
q.pop();
v.push_back(n->val);
if (n->left) q.push(n->left);
if (n->right) q.push(n->right);
}
res.push_back(v);
}
return res;
}
};