摘要：
Amazon Interview Question SDE1sGiven a binary tree. Modify it in such a way that after modification you can have a preorder traversal of it using only right pointers. During modification you can use right as well as left pointers. Write complete code and dry run it for some test cases左子树转换后的最右叶子节点的右 阅读全文