50 docs tagged with "Binary Tree"

This is a solution to the 2096. Step-By-Step Directions From a Binary Tree Node to Another problem on LeetCode.

This is a solution to the All Elements in Two Binary Search Trees.

This is a solution to the Balanced Binary Tree problem on LeetCode.

This is a solution to the Balanced Tree Check problem.

This is a solution to the Binary Search problem on LeetCode.

This is a solution to the Binary Search Tree to Greater Sum Tree problem on LeetCode.

This is a solution to the Binary Tree Cameras problem on LeetCode.

Problem

Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf to root).

This is a solution to binary-tree-longest-consecutive-sequence-ii problem on LeetCode.

This is a solution to the Binary Tree maximum path sum on LeetCode.

This is a solution to the Binary Tree Right Side View problem on LeetCode.

This is a solution to the Binary Tree Tilt problem on LeetCode.

This is a solution to the Binary Tree to DLL problem on GeeksForGeeks.

Solution to leetocde 156

This is a solution to the Balanced Binary Tree problem on LeetCode.

Given two integer arrays inorder and postorder where inorder is the inorder traversal of a binary tree and postorder is the postorder traversal of the same tree, construct and return the binary tree.

Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree.

Given the root of a binary tree, construct a string consisting of parenthesis and integers from a binary tree with the preorder traversal way.

Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus the sum of all keys greater than the original key in BST.

Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.

This document provides solutions for counting the number of leaf nodes in a binary tree.

Solve the problem of deleting nodes from a binary tree and returning the forest of remaining trees using depth-first search.

This document provides solutions for depth-of-bst-given-insertion-order.

This tutorial covers the solution to the Determine if Two Trees are Identical problem from the GeeksforGeeks website, featuring implementations in Python and C++.

This is a solution to the Diameter of Binary tree problem on LeetCode.

Given the root of a full binary tree, evaluate the boolean result based on the given rules.

Given the root of a binary tree, return the leftmost value in the last row of the tree.

This is a solution to the Find Largest Value in Each Tree Row problem on LeetCode.

This is a solution to the Find Right Interval problem on LeetCode.

This tutorial covers the solution to the Height of Binary Tree problem from the GeeksforGeeks website, featuring implementations in Python and C++.

This document provides solutions for inorder traversal of a tree.

This is a solution to the Insert into a Binary Search Tree problem on LeetCode.

Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST.

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

This is a solution to the Maximum Depth of Binary Tree problem on LeetCode.

This is a solution to the Maximum Level Sum of a Binary Tree problem on LeetCode.

Given the root of a binary tree, return the most frequent subtree sum. If there is a tie, return all the values with the highest frequency in any order.

This is a solution to the My Calendar I problem on LeetCode.

This is a solution to the Path Sum III problem on LeetCode.

This document provides solutions postorder traversal of a binary tree.

This is a solution to the Same Tree problem on LeetCode.

This is a solution to the Search in a Binary Search Tree problem on LeetCode.

This document covers methods to calculate the size (number of nodes) of a binary tree in various programming languages.

Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot and false otherwise.

This is a solution to the Subtree Removal Game with Fibonacci Tree problem on LeetCode.

This is a solution to the Symmetric Tree problem on LeetCode.

Problem Description

This is a solution to the Valid Triangle Number problem on LeetCode.

This is a solution to the Vertical Order Traversal of a Binary Tree problem on LeetCode.