52 docs tagged with "Tree"

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

This is a solution to the Balanced Tree Check problem.

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.

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

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 the Binary Tree Level Order Traversal problem on LeetCode.

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

Solution to Leetcode 257. Binary Tree Paths

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

Given a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level and alternate between).

This is a solution to the Check for Balanced Tree problem on Geeks for Geeks.

This document provides solutions for the Construct Binary Search Tree from Preorder Traversal problem.

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 is a solution to the Convert Sorted List to Binary Search Tree problem on LeetCode.

This is a solution to the Count Complete tree nodes

Given a binary tree, count the number of visible nodes. A node is considered visible if, in the path from the root to that node, there are no nodes with a greater value.

This is a solution to the Deepest Leaves Sum problem on LeetCode.

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++.

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

Determine if a binary tree is an "even-odd" tree, where the level of nodes alternates between odd and even values.

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 Root of N-Ary Tree problem on LeetCode.

This is a solution to the Flatten Binary Tree To Linked List 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 is a solution to the Insert into a Binary Search Tree problem on LeetCode.

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

A solution to the problem of finding all the nodes which are at a distance k from the root

This document provides a solution where we Find the kth ancestor of a given node.

This is a solution to theKth Smallest Element in 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 document provides solutions for the Maximum Difference Between Node and Ancestor problem.

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

Given two binary trees, merge them into a new binary tree by adding the values of overlapping nodes.

This is a solution to the Minimum Time to Collect All Apples in a 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.

Given the root of an n-ary tree, return the postorder traversal of its nodes' values.

Given the root of an n-ary tree, return the preorder traversal of its nodes' values.

Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum.

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

Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values in the path equals targetSum. Each path should be returned as a list of the node values, not node references.

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

This is a solution to the Smallest Missing Genetic Value in Each Subtree problem on LeetCode.

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.

You are given the root of a binary tree containing digits from 0 to 9 only.Each root-to-leaf path in the tree represents a number.

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