Binary Search Algorithm to Find Next Node on Its Right in a Binary Tree
You are given a binary tree root containing unique values, and an integer target. Find the node with value target and return the node that’s directly right of it …
Tag: binary tree algorithms
Recursive Depth First Search Algorithm to Convert to Full Binary Tree By Removing Single-Child Nodes
Given a binary tree root, remove all nodes with only one child. Constraints n ≤ 100,000 where n is the number of nodes in root Example 1 Input root …
Compute the Deepest Leaves Sum of a Binary Tree using BFS or DFS Algorithms
Given a binary tree, return the sum of values of its deepest leaves. Example 1: Input: root = Output: 15 Constraints: The number of nodes in the tree is …
How to Check if a Binary Tree is Balanced (Top-down and Bottom-up Recursion)?
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the depth of the two …
How to Compute the Maximum Difference Between Node and Ancestor?
Given the root of a binary tree, find the maximum value V for which there exists different nodes A and B where V = |A.val – B.val| and A …