Welcome to Subscribe On Youtube
Formatted question description: https://leetcode.ca/all/545.html
545. Boundary of Binary Tree
Level
Medium
Description
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. (The values of the nodes may still be duplicates.)
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.
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].
Solution
Visit the binary tree in the following order: the root, the left subtree, the leaf nodes, and the right subtree.
- The root is the first node in the boundary.
- If the root has a left child, then visit the left subtree. The first node visited after the root is the left child of the root, and add the left child to the boundary. Then each time check whether the current node has a left child. If so, move to the left child. Otherwise, move to the right child (if it has a right child). As long as the current node is not a leaf node, add it to the boundary.
- Visit all the leaf nodes from left to right, and add the leaf nodes to the boundary.
- If the root has a right child, then visit the right subtree. The right subtree is visited quite similar to the way that the left subtree is visited, but the right child is considered before the left child, and the nodes are added to the boundary in reversing order.
Finally, return the list of the boundary.
-
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ class Solution { public List<Integer> boundaryOfBinaryTree(TreeNode root) { List<Integer> boundaryList = new ArrayList<Integer>(); if (root == null) return boundaryList; if (!isLeaf(root)) boundaryList.add(root.val); TreeNode node = root.left; while (node != null) { if (!isLeaf(node)) boundaryList.add(node.val); if (node.left != null) node = node.left; else node = node.right; } addLeafNodes(boundaryList, root); Stack<Integer> stack = new Stack<Integer>(); node = root.right; while (node != null) { if (!isLeaf(node)) stack.push(node.val); if (node.right != null) node = node.right; else node = node.left; } while (!stack.isEmpty()) boundaryList.add(stack.pop()); return boundaryList; } public boolean isLeaf(TreeNode t) { return t.left == null && t.right == null; } public void addLeafNodes(List<Integer> boundaryList, TreeNode root) { if (isLeaf(root)) boundaryList.add(root.val); else { if (root.left != null) addLeafNodes(boundaryList, root.left); if (root.right != null) addLeafNodes(boundaryList, root.right); } } } -
// OJ: https://leetcode.com/problems/boundary-of-binary-tree/ // Time: O(N) // Space: O(H) class Solution { vector<int> ans, right; void dfs(TreeNode *node, int state) { // 1 left boundary, 2 right boundary, 0 otherwise if (!node) return; if (state == 1) ans.push_back(node->val); else if (state == 2) right.push_back(node->val); else if (!node->left && !node->right) ans.push_back(node->val); dfs(node->left, state == 1 ? 1 : (state == 2 && !node->right ? 2 : 0)); dfs(node->right, state == 2 ? 2 : (state == 1 && !node->left ? 1 : 0)); } public: vector<int> boundaryOfBinaryTree(TreeNode* root) { ans.push_back(root->val); dfs(root->left, 1); dfs(root->right, 2); for (int i = right.size() - 1; i >= 0; --i) ans.push_back(right[i]); return ans; } }; -
# 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 boundaryOfBinaryTree(self, root: TreeNode) -> List[int]: self.res = [] if not root: return self.res # root if not self.is_leaf(root): self.res.append(root.val) # left boundary t = root.left while t: if not self.is_leaf(t): self.res.append(t.val) t = t.left if t.left else t.right # leaves self.add_leaves(root) # right boundary(reverse order) s = [] t = root.right while t: if not self.is_leaf(t): s.append(t.val) t = t.right if t.right else t.left while s: self.res.append(s.pop()) # output return self.res def add_leaves(self, root): if self.is_leaf(root): self.res.append(root.val) return if root.left: self.add_leaves(root.left) if root.right: self.add_leaves(root.right) def is_leaf(self, node) -> bool: return node and node.left is None and node.right is None ############ # Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution(object): def boundaryOfBinaryTree(self, root): """ :type root: TreeNode :rtype: List[int] """ if not root: return [] def dfsLeft(root, res): if not root or (not root.left and not root.right): return res.append(root.val) if root.left: dfsLeft(root.left, res) else: dfsLeft(root.right, res) def dfsRight(root, res): if not root or (not root.left and not root.right): return if root.right: dfsRight(root.right, res) else: dfsRight(root.left, res) res.append(root.val) def dfsLeaves(root, res, mid): if not root: return if not root.left and not root.right and root != mid: res.append(root.val) dfsLeaves(root.left, res, mid) dfsLeaves(root.right, res, mid) res = [root.val] dfsLeft(root.left, res) dfsLeaves(root, res, root) dfsRight(root.right, res) return res -
/** * Definition for a binary tree node. * function TreeNode(val, left, right) { * this.val = (val===undefined ? 0 : val) * this.left = (left===undefined ? null : left) * this.right = (right===undefined ? null : right) * } */ /** * @param {TreeNode} root * @return {number[]} */ var boundaryOfBinaryTree = function (root) { let leftBoundary = function (root, res) { while (root) { let curVal = root.val; if (root.left) { root = root.left; } else if (root.right) { root = root.right; } else { break; } res.push(curVal); } }; let rightBoundary = function (root, res) { let stk = []; while (root) { let curVal = root.val; if (root.right) { root = root.right; } else if (root.left) { root = root.left; } else { break; } stk.push(curVal); } let len = stk.length; for (let i = 0; i < len; i++) { res.push(stk.pop()); } }; let levelBoundary = function (root, res) { if (root) { levelBoundary(root.left, res); if (!root.left && !root.right) { res.push(root.val); } levelBoundary(root.right, res); } }; let res = []; if (root) { res.push(root.val); leftBoundary(root.left, res); if (root.left || root.right) { levelBoundary(root, res); } rightBoundary(root.right, res); } return res; };