import java.util.*;
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
TreeNode head = null; // 链表头节点
TreeNode pre = null; // 前一个节点
public TreeNode Convert(TreeNode pRootOfTree) {
if (pRootOfTree == null){
return null;
}
// 使用中序遍历,所以需要先遍历左子树
Convert(pRootOfTree.left);
if (head == null){
head = pRootOfTree;
pre = pRootOfTree;
} else{
pre.right = pRootOfTree;
pRootOfTree.left = pre;
pre = pRootOfTree;
}
Convert(pRootOfTree.right);
return head;
}
}
牛客网:NC64 二叉搜索树与双向链表
最新推荐文章于 2024-06-10 20:18:05 发布