/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
/*
解法:分成三个部分:
第一:遍历左边界 难点在于 除了根结点以外 如果节点没有左节点 却有右节点 那右节点也是左边界的成员,另外 左边界的叶子节点 与过后要用到的叶子节点会重复, 所以判定条件需用(head.left != null || head.right != null)
第二:遍历叶子节点;递归实现即可;
第三:理论同遍历左节点;但由于是逆序, 所以需要先建立一个stack 把节点存进去 之后再一一拿出来存到结果中
注意事项:右边界遍历需要额外避开root;另外在遍历有边界之前需要判定root是否有右节点, 如果没有 直接return, 否则会抛出空指针异常;
*/
public class Solution {
/**
* @param root: a TreeNode
* @return: a list of integer
*/
public List<Integer> boundaryOfBinaryTree(TreeNode root) {
List<Integer> result = new ArrayList<>();
if(root == null) return result;
TreeNode head = root;
//左边界遍历
while(head.left != null || head.right != null) {
result.add(head.val);
head = head.left == null ? head.right : head.left;
}
//叶子节点遍历
addLeave(root, result);
Stack<Integer> tail = new Stack<>();
if(root.right == null) return result;
head = root.right;
//右边界遍历;
while(head.right != null || head.left != null) {
tail.push(head.val);
head = head.right == null ? head.left : head.right;
}
while(!tail.isEmpty()) {
result.add(tail.pop());
}
return result;
}
private void addLeave(TreeNode root, List<Integer> result) {
if(root == null) return;
if(root.left == null && root.right == null) {
result.add(root.val);
}
addLeave(root.left, result);
addLeave(root.right, result);
}
}
Boundary of Binary Tree leetcode java 走地牙
最新推荐文章于 2020-02-21 14:04:36 发布