106.从中序与后序遍历序列构造二叉树(递归)
class Solution {
Map<Integer, Integer> map = new HashMap<>();
public TreeNode buildTree(int[] inorder, int[] postorder) {
int inLen = inorder.length;
int postLen = postorder.length;
if(inLen != postLen) return null;
for(int i = 0; i < inLen; i++) {
map.put(inorder[i], i);
}
return dfs(inorder, 0, inLen - 1, postorder, 0, postLen - 1);
}
public TreeNode dfs(int[] inorder, int inLeft, int inRight, int[] postorder, int postLeft, int postRight) {
if(inLfet > inRight || postLeft > postRight) return null;
int postVal = postorder[postRight];
TreeNode root = new TreeNode(postVal);
int inMid = map.get(postVal);
root.left(inorder, inLeft, inMid - 1, postorder, postLeft, inMid - inLeft - 1 + postLeft);
root.right = dfs(inorder, inMid + 1, inRight, postorder, inMid - inLeft + postLeft, postRight - 1);
return root;
}
}
109.有序链表转换二叉搜索树(快慢指针 + 中序遍历(递归))
class Solution {
public TreeNode sortedListToBST(ListNode head) {
if(head == null) return null;
if(head.next == null) return new TreeNode(head.val);
ListNode slow = head, fast = head, pre = head;
while(fast != null && fast.next != null) {
pre = slow;
slow = slow.next;
fast = fast.next.next;
}
TreeNode root = new TreeNode(slow.val);
pre.next = null;
root.left = sortedListToBST(head);
root.right = sortedListBST(slow.next);
return root;
}
}