Binary-Tree

The Avalanche Algorithm — How To Calculate the Maximum Possible Path in a Binary Tree

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. » hackernoon.com | hackernoon.com

Solution: Construct Binary Tree from Preorder and Inorder Traversal

This is part of a series of Leetcode solution explanations (index). If you liked this solution or fou… » DEV Community | dev.to

Solution: Convert Sorted List to Binary Search Tree

This is part of a series of Leetcode solution explanations (index). If you liked this solution or fou… » DEV Community | dev.to

WTF is a Binary Search Tree?

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. » hackernoon.com | hackernoon.com

How Do We Get a Balanced Binary Tree?

A binary tree can be empty, implying zero nodes in the tree. The cool thing about binary trees is that they are recursive structures. » DEV Community | dev.to

How to check if a binary tree is balanced

An O(n) algorithm to check if a binary tree is balanced, by passing up the height from recursive calls. » jameshfisher.com | jameshfisher.com