[leetcode] 971. Flip Binary Tree To Match Preorder Traversal

Description

Given a binary tree with N nodes, each node has a different value from {1, …, N}.

A node in this binary tree can be flipped by swapping the left child and the right child of that node.

Consider the sequence of N values reported by a preorder traversal starting from the root. Call such a sequence of N values the voyage of the tree.

(Recall that a preorder traversal of a node means we report the current node’s value, then preorder-traverse the left child, then preorder-traverse the right child.)

Our goal is to flip the least number of nodes in the tree so that the voyage of the tree matches the voyage we are given.

If we can do so, then return a list of the values of all nodes flipped. You may return the answer in any order.

If we cannot do so, then return the list [-1].

Example 1:

Input: root = [1,2], voyage = [2,1]
Output: [-1]

Example 2:

Input: root = [1,2,3], voyage = [1,3,2]
Output: [1]

Example 3:

Input: root = [1,2,3], voyage = [1,2,3]
Output: []

Note:

1. 1 <= N <= 100

分析

题目的意思是：这道题我一开始没看懂，后面发现是看二叉树怎么翻转使得先序遍历等于voyage，如果不存在则返回-1，存在则返回翻转节点的集合。

代码

# 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 solve(self,root,voyage):
        if(root is None):
            return 
        elif(root.val!=voyage[0]):
            self.res=[-1]
            return
        voyage.pop(0)
        if(root.left and root.left.val!=voyage[0]):
            temp=root.left
            root.left=root.right
            root.right=temp
            self.res+=[root.val]
            
        self.solve(root.left,voyage)
        self.solve(root.right,voyage)
            
    def flipMatchVoyage(self, root: TreeNode, voyage: List[int]) -> List[int]:
        self.res=[]
        self.solve(root,voyage)
        return self.res

参考文献

[LeetCode] Python3, recursive call solution.