16 docs tagged with "Binary Tree"

Given the root of a binary tree, the value of a target node target, and an integer k, return an array of the values of all nodes that have a distance k from the target node.

Given the root of a binary tree, return the average value of the nodes on each level in the form of an array.

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

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

Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

Given the root of 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).

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

Given the root of a binary tree, invert the tree, and return its root.

Given the root of a binary tree, return its maximum depth.

Imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge the two trees into a new binary tree.

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

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.

You are given a perfect binary tree where all leaves are on the same level, and every parent has two children.

Given a binary tree. Populate each next pointer to point to its next right node.

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

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.