Average of Levels in Binary Tree
Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.
Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.
Construct the maximum tree by the given array and return the root node of this tree.
Output the second minimum value in the set made of all the nodes’ value in the whole tree.
Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree.
Return this tree where every subtree (of the given tree) not containing a 1 has been removed.
Question
Question
Question