keywords:
bfs dfs recursion(递归)
leetcode相关题目地址
- Symmetic(adj,相对称的,均衡的) Tree
https://leetcode.com/problems/symmetric-tree/
For example, this binary tree [1,2,2,3,4,4,3] is symmetric:
1
/ \
2 2
/ \ / \
3 4 4 3
But the following [1,2,2,null,3,null,3] is not:
1
/ \
2 2
\ \
3 3
- Same Tree
https://leetcode.com/problems/same-tree/
ac代码如下
/**
* 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:
bool isSymmetric2(TreeNode* left, TreeNode* right)
{
if (left == NULL && right == NULL)
return true;
else if (left == NULL&&right != NULL)
return false;
else if (left != NULL&&right == NULL)
return false;
else if (left != NULL && right != NULL && left->val != right->val)
return false;
else
return isSymmetric2(left->left, right->right) && isSymmetric2(left->right, right->left);
}
// 判断根左右是否对称,不对其子树进行判断
bool isSymmetric(TreeNode* root) {
if (root == NULL)
return true;
return isSymmetric2(root->left, root->right);
}
};
Validate Binary Search Tree (BST 二叉搜索树)
https://leetcode.com/problems/validate-binary-search-tree/Balanced Binary Tree(平衡二叉树)
https://leetcode.com/problems/balanced-binary-tree/
解答
Symmetic tree 采用递归法判断,代码比较好些
Same tree
1 采用递归法判断,树与子树都是完全相同的
2 序列化树,然后判断字符串是否相等
序列化二叉树参考:
http://blog.csdn.net/qq_26437925/article/details/51914802BST 二叉搜索树
根据二叉搜索树树的特性,中序遍历应该是一致增大(较小)的。
可采用先求出中序遍历数组,然后逐一判断是否符合一致增序的
二叉树几种非递归遍历参考:
http://blog.csdn.net/qq_26437925/article/details/48197859Balanced Binary Tree
直接采用递归方法求解,其中求树的高度也可采用递归方法
各种变式题
树的同构
http://blog.csdn.net/qq_26437925/article/details/49020091
笛卡尔树
http://blog.csdn.net/qq_26437925/article/details/49529739
patest 5-28 搜索树判断 (25分)
http://blog.csdn.net/qq_26437925/article/details/49488143