Given a binary tree root, return the sum of all values in the tree.
Constraints
n ≤ 100,000 where n is the number of nodes in roothttps://binarysearch.com/problems/Tree-Sum
Input
Output
11Explanation
11 = 1 + 2 + 3 + 5
Input
Output
6Explanation
6 = 1 + 2 + 3
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