* Given two binary trees, write a function to check if they are the same or not. * Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

- find successors and predecessors using BST (both list will be sorted); in the end, we can easily get top k from the two sorted list - with BST: **inorder traversal gives us sorted predecessors - ...