LeetCode --- 993. Cousins in Binary Tree 解题报告
Posted 杨鑫newlfe
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了LeetCode --- 993. Cousins in Binary Tree 解题报告相关的知识，希望对你有一定的参考价值。
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:
以上是关于LeetCode --- 993. Cousins in Binary Tree 解题报告的主要内容，如果未能解决你的问题，请参考以下文章
LeetCode --- 993. Cousins in Binary Tree 解题报告
Leetcode-993 Cousins in Binary Tree(二叉树的堂兄弟节点)