lintcode378. 将二叉树转换成双链表

将一个二叉树按照中序遍历转换成双向链表。

样例
样例 1：

输入:
	    4
	   / \
	  2   5
	 / \
	1   3		

输出: 1<->2<->3<->4<->5
样例 2：

输入:
	    3
	   / \
	  4   1

输出:4<->3<->1

/**
  * Definition of Doubly-ListNode
 * class DoublyListNode {
 * public:
 *     int val;
 *     DoublyListNode *next, *prev;
 *     DoublyListNode(int val) {
 *         this->val = val;
 *         this->prev = this->next = NULL;
 *     }
 * } * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */

class Solution {
public:
    /**
     * @param root: The root of tree
     * @return: the head of doubly list node
     */
    DoublyListNode * bstToDoublyList(TreeNode * root) {
        // write your code here
        if(root==NULL) return NULL;
        DoublyListNode*head=new DoublyListNode(0);
        DoublyListNode*p=head;
        build(root,p);
        head->next->prev=NULL;
        return head->next;
    }
    void build(TreeNode*root,DoublyListNode*&head)
    {
        if(root==NULL) return;
        build(root->left,head);
        DoublyListNode*p=new DoublyListNode(root->val);
        p->prev=head;
        head->next=p;
        head=p;
        build(root->right,head);
    }
};