#3319

K-th Largest Perfect Subtree Size in Binary Tree

specialist · 690 · lc medium +30 · 62.2% accepted · 153 likes · top 63%

Description

You are given the root of a binary tree and an integer k.

Return the size of the k^th largest perfect binary subtree, or -1 if no such subtree exists.

A perfect binary tree is one in which every internal node has exactly two children and all leaf nodes reside at the same depth.

Code

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def kthLargestPerfectSubtree(self, root: Optional[TreeNode], k: int) -> int:

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def kthLargestPerfectSubtree(self, root: Optional[TreeNode], k: int) -> int: