深度优先搜索
意难平丶NJUPT
这个作者很懒,什么都没留下…
展开
-
剑指offer26.树的子结构
0521代码class Solution {public: bool isSubStructure(TreeNode* A, TreeNode* B) { if(A==NULL||B==NULL) return false; return q_val(A,B)||isSubStructure(A>left,B) ||isSubStructure(A->right,B); } bool q_val(TreeNode*A,原创 2022-05-21 11:01:04 · 137 阅读 · 0 评论 -
剑指offer8.二叉树最近公共祖先2,0514
代码class Solution {public: TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { if(root==NULL||root==p||root==q) return root; TreeNode *left=lowestCommonAncestor(root->left,p,q); TreeNode *right=lo原创 2022-05-15 08:40:12 · 76 阅读 · 0 评论 -
剑指offer68.二叉搜索树的公共祖先
代码class Solution {public: TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { while(1){ if(root->val>p->val&&root->val>q->val){ root=root->left; }else原创 2022-05-13 20:42:39 · 132 阅读 · 0 评论