Subtree of Another Tree (LeetCode 572)
The problem You get two binary trees, and . Return if contains a node whose…
Tag
20 posts
The problem You get two binary trees, and . Return if contains a node whose…
The problem Design a with two methods: turns a binary tree into a string…
The problem You get the roots and of two binary trees. Return if they are the…
The problem You get a perfect binary tree: every internal node has exactly two…
The problem You get the root of a binary tree and an integer . Return if some…
The problem You get the of a binary tree. Return its minimum depth: the number…
The problem You get the root of a binary tree (not a BST) and two values and…
The problem You get the root of a binary tree. Return its maximum depth: the…
The problem You get the root of a binary search tree and two values and that…
The problem You get the root of a binary tree. Invert it, meaning produce its…
The problem Houses form a binary tree. Each node has a value (the money inside…
The problem You get the root of a binary tree. Return its diameter: the number…
The problem You get the of a binary tree with unique values, and two different…
The problem You get two lists for the same binary tree: its preorder traversal…
The problem You get the of a binary tree. Imagine standing to its right and…
The problem You get the of a binary tree. Return its values level by level…
The problem You get the of a binary tree. Return its values level by level, but…
The problem You get the of a binary tree. Return its values level by level, but…
The problem You get the of a non-empty binary tree. Return a list where the -th…
The problem You get the root of a binary tree whose values can be negative. A…