http://karpoke.ignaciocano.com/tags/binary-tree/Recent content in Binary-Tree on Karpoke - Just Another BlogHugo -- 0.167.0esMon, 12 Feb 2024 13:27:46 +0100http://karpoke.ignaciocano.com/2024/02/12/the-avalanche-algorithm-how-to-calculate-the-maximum-possible-path-in-a-binary-t/Mon, 12 Feb 2024 13:27:46 +0100http://karpoke.ignaciocano.com/2024/02/12/the-avalanche-algorithm-how-to-calculate-the-maximum-possible-path-in-a-binary-t/<blockquote> <p>In this article we try to calculate the maximum possible path in a binary tree, describing a more efficient method than the brute force solution.</p> </blockquote> <p>» hackernoon.com | <a href="https://hackernoon.com/the-avalanche-algorithm-how-to-calculate-the-maximum-possible-path-in-a-binary-tree">hackernoon.com</a></p>http://karpoke.ignaciocano.com/2021/06/09/solution-construct-binary-tree-from-preorder-and-inorder-traversal/Wed, 09 Jun 2021 08:30:56 +0100http://karpoke.ignaciocano.com/2021/06/09/solution-construct-binary-tree-from-preorder-and-inorder-traversal/<blockquote> <p>This is part of a series of Leetcode solution explanations (index). If you liked this solution or fou&hellip;</p> </blockquote> <p>» DEV Community | <a href="https://dev.to/seanpgallivan/solution-construct-binary-tree-from-preorder-and-inorder-traversal-32c5">dev.to</a></p>http://karpoke.ignaciocano.com/2021/05/06/solution-convert-sorted-list-to-binary-search-tree/Thu, 06 May 2021 14:39:59 +0100http://karpoke.ignaciocano.com/2021/05/06/solution-convert-sorted-list-to-binary-search-tree/<blockquote> <p>This is part of a series of Leetcode solution explanations (index). If you liked this solution or fou&hellip;</p> </blockquote> <p>» DEV Community | <a href="https://dev.to/seanpgallivan/solution-convert-sorted-list-to-binary-search-tree-2i0e">dev.to</a></p>http://karpoke.ignaciocano.com/2020/10/07/wtf-is-a-binary-search-tree/Wed, 07 Oct 2020 16:31:28 +0100http://karpoke.ignaciocano.com/2020/10/07/wtf-is-a-binary-search-tree/<blockquote> <p>The binary tree is a type of data structure that is commonly used to represent hierarchical data. It is an efficient way of storing and organizing data that is ranked in parent nodes and child nodes.</p> </blockquote> <p>» hackernoon.com | <a href="https://hackernoon.com/wtf-is-a-binary-search-tree-9ky3wk4">hackernoon.com</a></p>http://karpoke.ignaciocano.com/2020/09/01/how-do-we-get-a-balanced-binary-tree/Tue, 01 Sep 2020 22:28:34 +0100http://karpoke.ignaciocano.com/2020/09/01/how-do-we-get-a-balanced-binary-tree/<blockquote> <p>A binary tree can be empty, implying zero nodes in the tree. The cool thing about <code>binary trees</code> is that they are recursive structures.</p> </blockquote> <p>» DEV Community | <a href="https://dev.to/jacobjzhang/how-do-we-get-a-balanced-binary-tree-259e">dev.to</a></p>http://karpoke.ignaciocano.com/2020/02/08/how-to-check-if-a-binary-tree-is-balanced/Sat, 08 Feb 2020 12:21:51 +0100http://karpoke.ignaciocano.com/2020/02/08/how-to-check-if-a-binary-tree-is-balanced/<blockquote> <p>An O(n) algorithm to check if a binary tree is balanced, by passing up the height from recursive calls.</p> </blockquote> <p>» jameshfisher.com | <a href="https://jameshfisher.com/2020/01/23/how-to-check-if-a-binary-tree-is-balanced/">jameshfisher.com</a></p>