https://h30306.github.io/blog/tags/binary-tree/Recent content in Binary-Tree onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungSun, 01 Nov 2026 00:00:00 +0000https://h30306.github.io/blog/leetcode/leetcode-2385/Sun, 01 Nov 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2385/LeetCode 2385 note: turn the tree into an undirected graph and BFS from start; the number of levels minus one is the answerhttps://h30306.github.io/blog/leetcode/leetcode-968/Fri, 30 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-968/LeetCode 968 note: post-order greedy with three states per node: has a camera, covered, not covered; place a camera only when a child is uncovered, and add one if the root is left uncoveredhttps://h30306.github.io/blog/leetcode/leetcode-889/Thu, 29 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-889/LeetCode 889 note: keep the current path on a stack; when its top equals the next postorder value that subtree is complete and is popped; new nodes go left firsthttps://h30306.github.io/blog/leetcode/leetcode-437/Wed, 28 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-437/LeetCode 437 note: prefix sums on a tree with a hash map: look up prefix - target before adding the current prefix, and undo it when leaving the nodehttps://h30306.github.io/blog/leetcode/leetcode-863/Wed, 28 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-863/LeetCode 863 note: turn the tree into an undirected graph (adding edges to parents), then BFS k steps from targethttps://h30306.github.io/blog/leetcode/leetcode-652/Mon, 26 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-652/LeetCode 652 note: encode every subtree in post-order and report it on its second occurrence; string keys are O(n^2) worst case, (val, left id, right id) ids make it O(n)https://h30306.github.io/blog/leetcode/leetcode-297/Sun, 25 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-297/LeetCode 297 note: pre-order with null markers identifies the tree uniquely; deserialize by consuming tokens from an iteratorhttps://h30306.github.io/blog/leetcode/leetcode-331/Sun, 25 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-331/LeetCode 331 note: count open slots: start with 1, every node fills one, a non-null node opens two more; never go negative and end at exactly 0https://h30306.github.io/blog/leetcode/leetcode-449/Sun, 25 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-449/LeetCode 449 note: for a BST, pre-order without null markers is enough; deserialize recursively with bounds in O(n)https://h30306.github.io/blog/leetcode/leetcode-450/Sun, 25 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-450/LeetCode 450 note: once the node is found: with zero or one child, splice the child in; with two, copy the right subtree’s minimum and delete that nodehttps://h30306.github.io/blog/leetcode/leetcode-99/Sun, 25 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-99/LeetCode 99 note: find the inversions in the in-order sequence: the earlier node of the first inversion and the later node of the last one were swappedhttps://h30306.github.io/blog/leetcode/leetcode-124/Sat, 24 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-124/LeetCode 124 note: DFS returns the best downward chain and updates the answer with left chain + node + right chain at every node; drop negative chainshttps://h30306.github.io/blog/leetcode/leetcode-1372/Sat, 24 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1372/LeetCode 1372 note: each node returns two values, the longest zigzag starting left and starting right; going left extends the left child’s start-right valuehttps://h30306.github.io/blog/leetcode/leetcode-173/Sat, 24 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-173/LeetCode 173 note: flattening to an array is simple but uses O(n) space; the follow-up keeps the left spine on a stack for amortized O(1) and O(h) spacehttps://h30306.github.io/blog/leetcode/leetcode-515/Sat, 24 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-515/LeetCode 515 note: BFS level order, taking the maximum of each level; start from -infhttps://h30306.github.io/blog/leetcode/leetcode-687/Sat, 24 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-687/LeetCode 687 note: DFS returns the longest same-value downward chain in edges, and each node updates the answer with left + righthttps://h30306.github.io/blog/leetcode/leetcode-701/Sat, 24 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-701/LeetCode 701 note: walk down the BST to an empty spot and attach the new node; an empty tree must return the new nodehttps://h30306.github.io/blog/leetcode/leetcode-314/Thu, 22 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-314/LeetCode 314 note: BFS with a column index; BFS is what guarantees top-to-bottom within a column and left-to-right within a rowhttps://h30306.github.io/blog/algorithm/tree/Tue, 20 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/algorithm/tree/DFS return values, BFS level order, BST bounds, climbing to the LCA, tree diameter, and leaf trimminghttps://h30306.github.io/blog/leetcode/leetcode-1028/Sat, 12 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1028/LeetCode 1028 note: a stack holds the path from the root to the current node, so its length is the depthhttps://h30306.github.io/blog/leetcode/leetcode-987/Sat, 12 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-987/LeetCode 987 note: collect (col, row, val) triples, sort them, and group by columnhttps://h30306.github.io/blog/leetcode/leetcode-2509/Fri, 11 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2509/LeetCode 2509 note: in heap numbering the parent is v // 2, so climb the larger node until both meet at the LCAhttps://h30306.github.io/blog/leetcode/leetcode-2196/Fri, 26 Jun 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2196/LeetCode 2196 note: keep nodes in a dict and link them in one pass; the root is the only value that is nobody’s childhttps://h30306.github.io/blog/leetcode/leetcode-1339/Fri, 09 Jan 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1339/LeetCode 1339 note: compute the total, enumerate every subtree sum, and leave the input untouchedhttps://h30306.github.io/blog/leetcode/leetcode-865/Fri, 09 Jan 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-865/LeetCode 865 note: BFS to the last level and climb together, or one DFS returning (depth, node)https://h30306.github.io/blog/leetcode/leetcode-1161/Tue, 06 Jan 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1161/LeetCode 1161 note: pushing None into the next level creates a fake level with sum 0https://h30306.github.io/blog/leetcode/leetcode-2236/Wed, 17 Dec 2025 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2236/LeetCode 2236 note: a warm-up, plus practice with C++ pointer accesshttps://h30306.github.io/blog/leetcode/leetcode-1008/Wed, 16 Jul 2025 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1008/LeetCode 1008 note: splitting the array is O(n^2); recursing with an upper bound is O(n)https://h30306.github.io/blog/leetcode/leetcode-958/Wed, 16 Jul 2025 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-958/LeetCode 958 note: completeness is a global property, so check with BFS whether any node follows the first gaphttps://h30306.github.io/blog/leetcode/leetcode-103/Fri, 18 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-103/LeetCode 103 note: a normal level-order traversal with every odd level reversed gives the zigzaghttps://h30306.github.io/blog/leetcode/leetcode-107/Fri, 18 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-107/LeetCode 107 note: a normal level-order traversal reversed at the end gives bottom-up orderhttps://h30306.github.io/blog/leetcode/leetcode-113/Fri, 18 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-113/LeetCode 113 note: backtrack with the current path and store a copy at a leaf whose total matches; values can be negative, so no early pruninghttps://h30306.github.io/blog/leetcode/leetcode-117/Fri, 18 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-117/LeetCode 117 note: connect next pointers level by level with BFS; for a non-perfect tree, looking only at the neighbour’s children breaks the chainhttps://h30306.github.io/blog/leetcode/leetcode-129/Fri, 18 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-129/LeetCode 129 note: on the way down multiply the current number by 10 and add the node’s value, adding it to the total at a leafhttps://h30306.github.io/blog/leetcode/leetcode-222/Fri, 18 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-222/LeetCode 222 note: in a complete tree, equal leftmost depths on both sides mean one side is perfect, counted as 2^h - 1, for O(log² n)https://h30306.github.io/blog/leetcode/leetcode-2331/Fri, 18 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2331/LeetCode 2331 note: leaves are 0 or 1 and internal nodes are 2 for OR and 3 for AND, evaluated in post-orderhttps://h30306.github.io/blog/leetcode/leetcode-236/Fri, 18 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-236/LeetCode 236 note: recursion returns whichever of p or q a subtree contains; finding something on both sides means they split here, so this node is the LCAhttps://h30306.github.io/blog/leetcode/leetcode-1379/Thu, 17 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1379/LeetCode 1379 note: walk both trees in lockstep; when the original reaches target, the clone’s node at the same position is the answer, comparing node identityhttps://h30306.github.io/blog/leetcode/leetcode-337/Wed, 16 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-337/LeetCode 337 note: tree DP where each node returns the best (rob it, skip it) pair; not robbing alternate levelshttps://h30306.github.io/blog/leetcode/leetcode-102/Sat, 29 Oct 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-102/LeetCode 102 note: BFS one whole level at a time, building the next level from the current one; an empty tree returns an empty listhttps://h30306.github.io/blog/leetcode/leetcode-1448/Sat, 29 Oct 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1448/LeetCode 1448 note: pass the path maximum down during DFS; a node is good when its value is at least that maximumhttps://h30306.github.io/blog/leetcode/leetcode-199/Sat, 29 Oct 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-199/LeetCode 199 note: in a level-order traversal, each level’s rightmost node is what you see from the righthttps://h30306.github.io/blog/leetcode/leetcode-230/Sat, 29 Oct 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-230/LeetCode 230 note: a BST’s in-order traversal is ascending, so stop an iterative in-order walk at the k-th nodehttps://h30306.github.io/blog/leetcode/leetcode-98/Sat, 29 Oct 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-98/LeetCode 98 note: every node has a valid range (low, high); going left the upper bound becomes the node and going right the lower bound does; comparing parent and child is not enoughhttps://h30306.github.io/blog/leetcode/leetcode-1022/Tue, 27 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1022/LeetCode 1022 note: on the way down double the current number and add the node’s bit, adding it to the total at a leafhttps://h30306.github.io/blog/leetcode/leetcode-938/Mon, 26 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-938/LeetCode 938 note: prune with the BST order, going only right below low and only left above high, adding nodes inside the rangehttps://h30306.github.io/blog/leetcode/leetcode-965/Mon, 26 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-965/LeetCode 965 note: every value must equal the root’s; compare values while recursing, not the booleans the recursion returnshttps://h30306.github.io/blog/leetcode/leetcode-993/Mon, 26 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-993/LeetCode 993 note: cousins share a depth but not a parent; record x’s and y’s depth and parent during DFS and comparehttps://h30306.github.io/blog/leetcode/leetcode-872/Sat, 17 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-872/LeetCode 872 note: collect leaves left to right with DFS; BFS collects level by level, which is not left-to-right orderhttps://h30306.github.io/blog/leetcode/leetcode-700/Wed, 31 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-700/LeetCode 700 note: go left when the node is larger, right when smaller, and return the node when foundhttps://h30306.github.io/blog/leetcode/leetcode-637/Mon, 29 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-637/LeetCode 637 note: level-order traversal, dividing each level’s sum by its counthttps://h30306.github.io/blog/leetcode/leetcode-671/Mon, 29 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-671/LeetCode 671 note: the root is the minimum; the second minimum is the smallest value larger than the root, and only subtrees equal to the root need searchinghttps://h30306.github.io/blog/leetcode/leetcode-606/Sun, 28 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-606/LeetCode 606 note: output in pre-order, keeping an empty () when only the left subtree is missing, and omitting the right parentheses when it is emptyhttps://h30306.github.io/blog/leetcode/leetcode-563/Sat, 27 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-563/LeetCode 563 note: return subtree sums in post-order; each node’s tilt is the difference of its subtree sums, added to the answerhttps://h30306.github.io/blog/leetcode/leetcode-572/Sat, 27 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-572/LeetCode 572 note: for every node of root, check whether its subtree equals subRoot; recurse with isSubtree, not by comparing only the childrenhttps://h30306.github.io/blog/leetcode/leetcode-501/Thu, 25 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-501/LeetCode 501 note: a BST’s in-order is sorted, so equal values are contiguous; count the current run during in-order, resetting the answer on a new maximum and appending on a tiehttps://h30306.github.io/blog/leetcode/leetcode-543/Thu, 25 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-543/LeetCode 543 note: the diameter may skip the root; return heights in post-order while updating the answer with left + right height at every node, counting edgeshttps://h30306.github.io/blog/leetcode/leetcode-404/Tue, 23 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-404/LeetCode 404 note: tell each child during DFS whether it is a left child, adding only left children that are leaveshttps://h30306.github.io/blog/leetcode/leetcode-235/Mon, 22 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-235/LeetCode 235 note: go left when both p and q are smaller, right when both are larger; otherwise (split, or one is the node itself) this node is the LCAhttps://h30306.github.io/blog/leetcode/leetcode-226/Sun, 21 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-226/LeetCode 226 note: swap every node’s children, using a simultaneous assignment so the already-changed side is not reusedhttps://h30306.github.io/blog/leetcode/leetcode-145/Sat, 20 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-145/LeetCode 145 note: iterative post-order pushes a node back with a visited flag on its first pop, then the right and left children; record it on the second pophttps://h30306.github.io/blog/leetcode/leetcode-110/Tue, 16 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-110/LeetCode 110 note: every node’s subtree heights must differ by at most 1; return heights in post-order and propagate -1 once unbalancedhttps://h30306.github.io/blog/leetcode/leetcode-111/Tue, 16 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-111/LeetCode 111 note: minimum depth must end at a leaf; with only one child, the empty side (depth 0) cannot count as the minimumhttps://h30306.github.io/blog/leetcode/leetcode-112/Tue, 16 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-112/LeetCode 112 note: subtract each value from targetSum on the way down; it works if the remainder matches at a leafhttps://h30306.github.io/blog/leetcode/leetcode-100/Tue, 02 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-100/LeetCode 100 note: two empty trees are equal, one empty and one not differ, and otherwise compare values and recurse on both sideshttps://h30306.github.io/blog/leetcode/leetcode-101/Tue, 02 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-101/LeetCode 101 note: the left and right subtrees must mirror each other, outer with outer and inner with inner; compare values, not node objectshttps://h30306.github.io/blog/leetcode/leetcode-104/Tue, 02 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-104/LeetCode 104 note: depth is 1 plus the larger subtree depth, with 0 for an empty treehttps://h30306.github.io/blog/leetcode/leetcode-144/Wed, 20 Jul 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-144/LeetCode 144 note: iterative pre-order traversal records on pop and pushes the right child before the left so the left is handled firsthttps://h30306.github.io/blog/leetcode/leetcode-94/Wed, 20 Jul 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-94/LeetCode 94 note: iterative in-order traversal, pushing nodes while going left, recording on pop, then turning to the right subtree