Tree

formal language.

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.

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 search tree, and an integer `k`, return the `kth` smallest value (**1-indexed**) of all the values of the nodes in the tree.

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

nodes in the sequence has an edge connecting them.

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

Given an integer array `nums` where the elements are sorted in **ascending order**, convert it to a **height-balanced** binary search 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, return its maximum depth.