Leetcode二叉树小结

1. 二叉树题目经常需要开辟头节点head和前节点pre。剑指 Offer 36

   class Solution {
       Node pre, head;
       public Node treeToDoublyList(Node root) {
           if(root == null) return null;
           dfs(root);
           head.left = pre;
           pre.right = head;
           return head;
       }
       void dfs(Node cur) {
           if(cur == null) return;
           dfs(cur.left);
           if(pre != null) pre.right = cur;
           else head = cur;
           cur.left = pre;
           pre = cur;
           dfs(cur.right);
       }
   }	
   

2. 二叉树的许多题目都是基于基本的遍历方法。剑指 Offer 26,剑指 Offer 28

3. 在寻找二叉树的对应target值的某一路径时，可以使用deque来记录，方便删改，且可以通过判断target==0来返回。剑指 Offer 34