Leetcode 993. Cousins in Binary Tree (二叉树遍历好题)

  1. Cousins in Binary Tree
    Easy
    3.9K
    193
    Companies
    Given the root of a binary tree with unique values and the values of two different nodes of the tree x and y, return true if the nodes corresponding to the values x and y in the tree are cousins, or false otherwise.

Two nodes of a binary tree are cousins if they have the same depth with different parents.

Note that in a binary tree, the root node is at the depth 0, and children of each depth k node are at the depth k + 1.

Example 1:

Input: root = [1,2,3,4], x = 4, y = 3

Output: false

Example 2:

Input: root = [1,2,3,null,4,null,5], x = 5, y = 4

Output: true

Example 3:

Input: root = [1,2,3,null,4], x = 2, y = 3

Output: false

Constraints:

The number of nodes in the tree is in the range [2, 100].

1 <= Node.val <= 100

Each node has a unique value.

x != y

x and y are exist in the tree.

解法1:

cpp 复制代码
/**
 * 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:
    bool isCousins(TreeNode* root, int x, int y) {
        if (root->val == x || root->val == y) return false;
        helper(root, x, y, 0);
          if (depthX == depthY && fatherX != fatherY) {
            return true;
        } else {
            return false;
        }
    }
private:
    TreeNode *fatherX = NULL, *fatherY = NULL;
    int depthX = 0, depthY = 0;
    void helper(TreeNode *root, int x, int y, int depth) {
        if (!root || (fatherX && fatherY)) return;
        if (!fatherX) {
            if ((root->left && root->left->val == x) || 
                (root->right && root->right->val == x)) {
                depthX = depth + 1;
                fatherX = root;
            }
        }  
        if (!fatherY) {
            if ((root->left && root->left->val == y) || 
                (root->right && root->right->val == y)) {
                depthY = depth + 1;
                fatherY = root;
            }
        }
        helper(root->left, x, y, depth + 1);
        helper(root->right, x, y, depth + 1);
    }
};

二刷:

cpp 复制代码
/**
 * 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:
    bool isCousins(TreeNode* root, int x, int y) {
        helper(root, x, y, 0, NULL);
        if (depthX == depthY && fatherX != fatherY) return true;
        return false;
    }
private:
    int depthX = 0, depthY = 0;
    TreeNode *fatherX = NULL, *fatherY = NULL;
    void helper(TreeNode *root, int x, int y, int depth, TreeNode *father) {
        if (!root) return;
        if (root->val == x) {
            fatherX = father;
            depthX = depth;
        }
        if (root->val == y) {
            fatherY = father;
            depthY = depth;
        }
        helper(root->left, x, y, depth + 1, root);
        helper(root->right, x, y, depth + 1, root);
    }
};
相关推荐
liuyang-neu4 分钟前
力扣 155.最小栈
java·算法·leetcode
心软且酷丶9 分钟前
leetcode:2160. 拆分数位后四位数字的最小和(python3解法,数学相关算法题)
python·算法·leetcode
Musennn1 小时前
leetcode98.验证二叉搜索树:递归法中序遍历的递增性验证之道
java·数据结构·算法·leetcode
WLKQ1 小时前
【力扣】关于链表索引
java·leetcode·链表
reduceanxiety2 小时前
机试 | vector/array Minimum Glutton C++
数据结构·c++·算法
2301_794461572 小时前
力扣-最大连续一的个数
数据结构·算法·leetcode
清心歌3 小时前
二叉树遍历
数据结构·算法
不二狗4 小时前
每日算法 -【Swift 算法】字符串转整数算法题详解:myAtoi 实现与正则表达式对比
算法·正则表达式·swift
feifeigo1235 小时前
认知无线电系统中采用能量检测频谱感知
算法
ghie90905 小时前
基于MATLAB的大规模MIMO信道仿真
数据结构·算法·matlab