LeetCode - 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-mostnode.
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. Example 1
Input:
1
\
2
/ \
3 4 Ouput:
[1, 3, 4, 2] Explanation:
The root doesn't have left subtree, so the root itself is left boundary.
The leaves are node 3 and 4.
The right boundary are node 1,2,4. Note the anti-clockwise direction means you should output reversed right boundary.
So order them in anti-clockwise without duplicates and we have [1,3,4,2]. Example 2
Input:
____1_____
/ \
2 3
/ \ /
4 5 6
/ \ / \
7 8 9 10 Ouput:
[1,2,4,7,8,9,10,6,3] Explanation:
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].
这道题给了我们一棵二叉树,让我们以逆时针的顺序来输出树的边界,按顺序分别为左边界,叶结点和右边界。题目中给的例子也能让我们很清晰的明白哪些算是边界上的结点。那么最直接的方法就是分别按顺序求出左边界结点,叶结点,和右边界结点。那么如何求的,对于树的操作肯定是用递归最简洁啊,所以我们可以写分别三个递归函数来分别求左边界结点,叶结点,和右边界结点。首先我们先要处理根结点的情况,当根结点没有左右子结点时,其也是一个叶结点,那么我们一开始就将其加入结果res中,那么再计算叶结点的时候又会再加入一次,这样不对。所以我们判断如果根结点至少有一个子结点,我们才提前将其加入结果res中。然后再来看求左边界结点的函数,如果当前结点不存在,或者没有子结点,我们直接返回。否则就把当前结点值加入结果res中,然后看如果左子结点存在,就对其调用递归函数,反之如果左子结点不存在,那么对右子结点调用递归函数。而对于求右边界结点的函数就反过来了,如果右子结点存在,就对其调用递归函数,反之如果右子结点不存在,就对左子结点调用递归函数,注意在调用递归函数之后才将结点值加入结果res,因为我们是需要按逆时针的顺序输出。最后就来看求叶结点的函数,没什么可说的,就是看没有子结点存在了就加入结果res,然后对左右子结点分别调用递归即可
// "static void main" must be defined in a public class.
public class Main { public static class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
} public static void main(String[] args) {
TreeNode three = new TreeNode(3);
TreeNode four = new TreeNode(4);
TreeNode two = new TreeNode(2);
two.left = three;
two.right = four;
TreeNode one = new TreeNode(1);
one.right = two; List<Integer> list = boundaryOfBinaryTree(one);
for(Integer i : list){
System.out.println(i);
} } public static List<Integer> boundaryOfBinaryTree(TreeNode root) {
List<Integer> list = new ArrayList<>();
if(root == null){
return list;
}
if(root.left != null || root.right != null){
list.add(root.val);
}
findLeftBoundary(root.left, list);
findLeaves(root, list);
findRightBoundary(root.right, list);
return list;
} private static void findLeftBoundary(TreeNode root, List<Integer> res){
if(root == null || (root.left == null && root.right == null)){
return;
}
res.add(root.val);
if(root.left != null){
findLeftBoundary(root.left, res);
}
else{
findLeftBoundary(root.right, res);
}
} private static void findRightBoundary(TreeNode root, List<Integer> res){
if(root == null || (root.left == null && root.right == null)){
return;
}
res.add(root.val);
if(root.right != null){
findRightBoundary(root.right, res);
}
else{
findRightBoundary(root.left, res);
}
} private static void findLeaves (TreeNode root, List<Integer> res){
if(root == null){
return;
}
if(root.left == null && root.right == null){
res.add(root.val);
}
findLeaves(root.left, res);
findLeaves(root.right, res);
}
}
LeetCode - Boundary of Binary Tree的更多相关文章
- [LeetCode] Boundary of Binary Tree 二叉树的边界
Given a binary tree, return the values of its boundary in anti-clockwise direction starting from roo ...
- 【LEETCODE OJ】Binary Tree Postorder Traversal
Problem Link: http://oj.leetcode.com/problems/binary-tree-postorder-traversal/ The post-order-traver ...
- 【一天一道LeetCode】#107. Binary Tree Level Order Traversal II
一天一道LeetCode 本系列文章已全部上传至我的github,地址:ZeeCoder's Github 欢迎大家关注我的新浪微博,我的新浪微博 欢迎转载,转载请注明出处 (一)题目 来源: htt ...
- 【一天一道LeetCode】#103. Binary Tree Zigzag Level Order Traversal
一天一道LeetCode 本系列文章已全部上传至我的github,地址:ZeeCoder's Github 欢迎大家关注我的新浪微博,我的新浪微博 欢迎转载,转载请注明出处 (一)题目 来源: htt ...
- C++版 - 剑指offer 面试题39:判断平衡二叉树(LeetCode 110. Balanced Binary Tree) 题解
剑指offer 面试题39:判断平衡二叉树 提交网址: http://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222?tpId= ...
- (二叉树 递归) leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that ...
- (二叉树 递归) leetcode 106. Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that ...
- [LeetCode] 106. Construct Binary Tree from Postorder and Inorder Traversal_Medium tag: Tree Traversal
Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that ...
- LeetCode——Diameter of Binary Tree
LeetCode--Diameter of Binary Tree Question Given a binary tree, you need to compute the length of th ...
随机推荐
- python2和python3的区别总结
python2x和python3x区别: python2x:源码重复,不规范. python3x: 源码规范,优美,清晰,简单. 编译型:将代码一次性全部转化成字节码. 代表语言:C,C++ 优点: ...
- day06 小数据池,再谈编码
今日所学 一. 小数据池 二. is 和==的区别 三. 编码的问题 一.小数据池的作用 用来缓存数据 可以作用的数据类型: 整数(int), 字符串(str), 布尔值(bool). 什么是块 ...
- XML(二)
XML XML介绍 1.什么是xml? 概念:XML(EXtensible Markup Language)XML 指可扩展标记语言(EXtensible Markup Language) 可扩展:我 ...
- 深入理解java虚拟机---java虚拟机内存管理(六)
java虚拟机栈的理解 虚拟机栈就是我们所熟知的栈内存,栈内存属于线程独有的.而在栈内存中的局部变量表中存储的引用类型只是存储对象的内存地址.对象的创建在堆内存中,即对象在线程共享区中. 局部变量表: ...
- SQL-30 使用子查询的方式找出属于Action分类的所有电影对应的title,description
题目描述 film表 字段 说明 film_id 电影id title 电影名称 description 电影描述信息 CREATE TABLE IF NOT EXISTS film ( film_i ...
- EMIF接口与FPGA的互联(转)
reference: https://blog.csdn.net/ruby97/article/details/7539151 DSP6455的EMIFA模块 之前介绍了DSP6455的GPIO和中断 ...
- DevExpress WinForms v18.2新版亮点(一)
行业领先的.NET界面控件2018年第二次重大更新——DevExpress v18.2日前正式发布,本站将以连载的形式为大家介绍各版本新增内容.本文将介绍了DevExpress WinForms v1 ...
- mySql单列索引与联合索引的区别
引自https://my.oschina.net/857359351/blog/658668 第一张表gift和索引为联合索引,如图: 第二张表gift2为单列索引,如图: 下面开始进行测试: 相同的 ...
- matlab运行中出现“Caught "std::exception" Exception message is: Message Catalog MATLAB:builtins was not loaded from the file."
在我运行过程中,经常爆出这一不确定是什么的问题,经排查后发现,原来是fopen 文件后,没有及时fclose导致的.
- Problem C: 默认参数:求圆面积
Description 编写一个带默认值的函数,用于求圆面积.其原型为: double area(double r=1.0); 当调用函数时指定参数r,则求半径为r的圆的面积:否则求半径为1的圆面积. ...