Trees Problems

You are given the root of a binary tree with unique values, and an integer start. At minute 0, an infection starts from

Types of Binary Trees:

A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting

Given the root of a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right

Just remove the check from Top View's answer to ensure we consider the bottommost node at each horizontal level.

You are given a binary tree having 'n' nodes.

Given the root of a binary tree, return the length of the diameter of the tree.

Given the root of a binary tree, flatten the tree into a "linked list":

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

Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values

Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you c

Given the roots of two binary trees p and q, write a function to check if they are the same or not.

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

// Pair class to store node and its horizontal distance

Given the root of a binary search tree and an integer k, return true if there exist two elements in the BST such that th

Types of Binary Trees:

Given a binary tree, determine if it is height-balanced.