满二叉树:如果一棵二叉树只有度为0的结点和度为2的结点,并且度为0的结点在同一层上,则这棵二叉树为满二叉树
完全二叉树:在完全二叉树中,除了最底层节点可能没填满外,其余每层节点数都达到最大值,并且最下面一层的节点都集中在该层最左边的若干位置。若最底层为第 h 层,则该层包含 1~ 2^(h-1) 个节点
平衡二叉搜索树:又被称为AVL(Adelson-Velsky and Landis)树,且具有以下性质:它是一棵空树或它的左右两个子树的高度差的绝对值不超过1,并且左右两个子树都是一棵平衡二叉树
C++中map、set、multimap,multiset的底层实现都是平衡二叉搜索树
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
递归:
确定递归函数的参数和返回值
确定终止条件
确定单层递归的逻辑
迭代法
前序遍历
144. Binary Tree Preorder Traversal
https://leetcode.cn/problems/binary-tree-preorder-traversal/
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
if (!root) {
return {};
}
stack<TreeNode*>st;
st.push(root);
vector<int>res;
while (!st.empty()) {
TreeNode* curr = st.top();
st.pop();
res.push_back(curr->val);
if (curr->right) {
st.push(curr->right);
}
if (curr->left) {
st.push(curr->left);
}
}
return res;
}
};
中序遍历
94. Binary Tree Inorder Traversal
https://leetcode.cn/problems/binary-tree-inorder-traversal/
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
if (!root) {
return {};
}
vector<int>res;
stack<TreeNode*>st;
TreeNode* curr = root;
while (curr != NULL || !st.empty()) {
if (curr) {
st.push(curr);
curr = curr->left;
} else {
curr = st.top();
st.pop();
res.push_back(curr->val);
curr = curr->right;
}
}
return res;
}
};
后序遍历
145. Binary Tree Postorder Traversal
https://leetcode.cn/problems/binary-tree-postorder-traversal/
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
if (!root) {
return {};
}
vector<int>res;
stack<TreeNode*>st;
st.push(root);
while (!st.empty()) {
TreeNode* curr = st.top();
st.pop();
res.push_back(curr->val);
if (curr->left) {
st.push(curr->left);
}
if (curr->right) {
st.push(curr->right);
}
}
reverse(res.begin(), res.end());
return res;
}
};
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
if (!root) {
return {};
}
vector<int>res;
stack<TreeNode*>st;
TreeNode* curr = root;
TreeNode* prev = NULL;
while (curr || !st.empty()) {
while (curr) {
st.push(curr);
curr = curr->left;
}
curr = st.top();
st.pop();
if (!curr->right || curr->right == prev) {
res.push_back(curr->val);
prev = curr;
curr = NULL;
} else {
st.push(curr);
curr = curr->right;
}
}
return res;
}
};
迭代统一写法
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> result;
stack<TreeNode*> st;
if (root != NULL) st.push(root);
while (!st.empty()) {
TreeNode* node = st.top();
if (node != NULL) {
st.pop(); // 将该节点弹出,避免重复操作,下面再将右中左节点添加到栈中
if (node->right) st.push(node->right); // 添加右节点(空节点不入栈)
st.push(node); // 添加中节点
st.push(NULL); // 中节点访问过,但是还没有处理,加入空节点做为标记。
if (node->left) st.push(node->left); // 添加左节点(空节点不入栈)
} else { // 只有遇到空节点的时候,才将下一个节点放进结果集
st.pop(); // 将空节点弹出
node = st.top(); // 重新取出栈中元素
st.pop();
result.push_back(node->val); // 加入到结果集
}
}
return result;
}
};