Given a binary tree root, return the same tree except every node’s value is replaced by its original value plus all of the sums of its left and right subtrees.
Constraints
n ≤ 100,000 where n is the number of nodes in roothttps://binarysearch.com/problems/Elephant-Tree
Input
Output
You are given a binary tree root which is almost a binary search tree except two nodes’ values have been swapped. Return the original binary search tree.
Given a binary tree root, return the largest sum of a subtree that is also a binary search tree.
Given a binary tree root, return the longest path between any two nodes in the tree.
Given a binary tree root, return the top view of the tree, sorted left-to-right.
Leave a comment