1.中序遍历(转为双向链表)
import java.util.LinkedList;
public class Solution {
public TreeNode Convert(TreeNode root) {
if(root == null) return null;
LinkedList<TreeNode> st = new LinkedList<>();
TreeNode res = null, pre = null;
boolean flag = false;
while(root != null || !st.isEmpty()){
while(root != null){
st.push(root);
root = root.left;
}
root = st.pop();//此处必然不为空
if(!flag){
res = root;
pre = root;
flag = true;
}else{
pre.right = root;
root.left = pre;
pre = root;//指定下一次的pre
}
root = root.right;
}
return res;
}
}
如使用递推
public class Solution {
TreeNode res = null, pre = null;
public void pre(TreeNode root){
if(root == null) return;//注意这句不要忘了
pre(root.left);
if(pre == null){
pre = root;
res = root;
}else{
pre.right = root;
root.left = pre;
pre = root;
}
pre(root.right);
}
public TreeNode Convert(TreeNode root) {
if(root == null) return null;
pre(root);
return res;
}
}
2.若为先序遍历
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
import java.util.LinkedList;
public class Solution {
public TreeNode Convert(TreeNode root) {
if(root == null) return null;
LinkedList<TreeNode> st = new LinkedList<>();
TreeNode res = null, pre = null;
boolean flag = false;
while(root != null || !st.isEmpty()){
while(root != null){
if(!flag){
res = root;
pre = root;
flag = true;
}else{
pre.right = root;
root.left = pre;
pre = root;//指定下一次的pre
}
st.push(root);
root = root.left;
}
root = st.pop();//此处必然不为空
root = root.right;
}
return res;
}
}