leetcode Flatten Binary Tree to Linked List

Given a binary tree, flatten it to a linked list in-place.

For example,
Given

         1
        / \
       2   5
      / \   \
     3   4   6

The flattened tree should look like:

   1
    \
     2
      \
       3
        \
         4
          \
           5
            \
             6

keep track of parent

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void flatten(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(!root) return;
        get(root,root);
    }
    void get(TreeNode *root, TreeNode *& p){
        if(!root) return;
        
        TreeNode *l=root->left;
        TreeNode *r=root->right;
        
        if(root!=p){
            p->left=NULL;
            p->right=root;
            p=root;}
        get(l,p);
        get(r,p);   
    }
};