Tree

A trie(prefix tree) is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. Implement the Trie class.

Given an integer array nums and an integer k, return the kth largest element in the array.

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 Search Tree (BST), return the minimum difference between the values of any two different nodes in the tree.

Given the root of a Binary Search Tree (BST), convert it to a Greater Sum Tree

Given the root of a Binary Search Tree (BST), convert it to a Greater Sum Tree

Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.

Given a tree of n nodes, return a list of all MHT(Minimum Height Tree)s' root labels.'

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

Design an algorithm to serialize and deserialize a binary tree.

You are given two binary trees root1 and root2. Return the merged tree.

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

Given the root of a binary tree, return the length of the longest path, where each node in the path has the same value.

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

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