545. Boundary of Binary Tree

题目

Given a binary tree, return the values of its boundary in anti-clockwise direction starting from root. Boundary includes left boundary, leaves, and right boundary in order without duplicate nodes.

Left boundary is defined as the path from root to the left-most node. Right boundary is defined as the path from root to the right-most node. If the root doesn’t have left subtree or right subtree, then the root itself is left boundary or right boundary. Note this definition only applies to the input binary tree, and not applies to any subtrees.

The left-most node is defined as a leaf node you could reach when you always firstly travel to the left subtree if exists. If not, travel to the right subtree. Repeat until you reach a leaf node.

The right-most node is also defined by the same way with left and right exchanged.

Input: {1,2,3,4,5,6,#,#,#,7,8,9,10}
Output: [1,2,4,7,8,9,10,6,3]
Explanation: 
          1
     /          \
    2            3
   / \          / 
  4   5        6   
     / \      / \
    7   8    9  10  
  The left boundary are node 1,2,4. (4 is the left-most node according to definition)
  The leaves are node 4,7,8,9,10.
  The right boundary are node 1,3,6,10. (10 is the right-most node).
  So order them in anti-clockwise without duplicate nodes we have [1,2,4,7,8,9,10,6,3].

我的想法

总想着一步解决问题怎么行呢。。。

解答

jiuzhang solution:
把问题拆成三步：
第一步找到左边界（不包括边界上的叶子结点）
第二步找到所有叶子结点
第三步找到右边界（注意是逆时针，所以应该是从底部往上的顺序加入结点）

public class Solution {
    List<Integer> res;
    
    public List<Integer> boundaryOfBinaryTree(TreeNode root) {
        res = new ArrayList<>();
        if(root == null) {
            return res;
        }
        res.add(root.val);
        if(root.left == null & root.right == null) {
            return res;
        }
        addLeft(root.left);
        addLeaf(root);
        addRight(root.right);
        return res;
    }
    private void addLeft(TreeNode root) {
        if(root == null || root.left == null & root.right == null) {
            return;
        }
        res.add(root.val);
        if(root.left != null) {
             addLeft(root.left);
        } else {
             addLeft(root.right);
        }
    }
    private void addLeaf(TreeNode root) {
        if(root == null) {
            return;
        }
        if(root.left == null && root.right == null) {
            res.add(root.val);
        }
        addLeaf(root.left);
        addLeaf(root.right);
    }
    //注意，这里是逆时针，因此应该是递归完之后再加入结点
    private void addRight(TreeNode root) {
        if(root == null || root.left == null & root.right == null) {
            return;
        }
        if(root.right != null) {
             addRight(root.right);
        } else {
             addRight(root.left);
        }
        res.add(root.val);
    }
}