<ul><li>LeetCode 993: Cousins in Binary Tree – DFS and BFS Explained (Python)</li><li>Two nodes of a binary tree are cousins if they have the same depth but different parents.</li><li>DFS approach: Defines a helper function to find the depth and parent of the given node recursively.</li><li>BFS approach: Uses a queue to traverse the tree level-wise and checks if the given nodes have the same depth and different parents.</li></ul>

LeetCode 993: Cousins in Binary Tree – DFS and BFS Approaches Explained (Python)

Discover more