// Given the root of a binary tree, return the length of the diameter of the tree. // The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or ...

// Given the root of a binary tree, return the maximum width of the given tree. // The maximum width of a tree is the maximum width among all levels. // The width of one level is defined as the length ...