Given two trees root0 and root1, return whether you can transform root0 into root1 by swapping any node’s left and right subtrees any number of times.
https://binarysearch.com/problems/Swappable-Trees
Input
Output
TrueYou 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