Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it upside down and turn it into a tree where the original right nodes turned into left leaf nodes. Return the new root.
For example:
Given a binary tree{1,2,3,4,5},
1
/ \
2 3
/ \
4 5
return the root of the binary tree[4,5,2,#,#,3,1].
4
/ \
5 2
/ \
3 1
刷晕了。。。。 1， 一个节点的左孩子等于他的兄弟节点， 右孩子等于父节点。
第一种迭代方法， 比较好容易理解还节省栈空间
LeetCode 156 Binary Tree Upside Down Given a binary tree ...
Given a binary tree where all the right nodes are either ...
medium Question 二叉树的右节点要么是拥有姊妹节点的叶节点，要么是空。将二叉树上下颠倒，原来的右节点...
156 Binary Tree Upside Down 上下翻转二叉树 Description: Given th...
Given a binary tree where all the right nodes are either ...
Description: Given a binary tree where all the right node...
练手题：152. Maximum Product Subarray156. Binary Tree Upside ...
1. turn upside down=turn over 翻车、翻船、翻面 turn upside down [...
school upside down school upside 连读 turned our 连读 totally...
本文标题：156. Binary Tree Upside Down
本文链接：https://www.haomeiwen.com/subject/oeiymttx.html
网友评论