zoukankan      html  css  js  c++  java
  • LeetCode426.Convert Binary Search Tree to Sorted Doubly Linked List

    题目 

    Convert a BST to a sorted circular doubly-linked list in-place. Think of the left and right pointers as synonymous to the previous and next pointers in a doubly-linked list.

    Let's take the following BST as an example, it may help you understand the problem better: 

    We want to transform this BST into a circular doubly linked list. Each node in a doubly linked list has a predecessor and successor. For a circular doubly linked list, the predecessor of the first element is the last element, and the successor of the last element is the first element.

    The figure below shows the circular doubly linked list for the BST above. The "head" symbol means the node it points to is the smallest element of the linked list. 

    Specifically, we want to do the transformation in place. After the transformation, the left pointer of the tree node should point to its predecessor, and the right pointer should point to its successor. We should return the pointer to the first element of the linked list.

    The figure below shows the transformed BST. The solid line indicates the successor relationship, while the dashed line means the predecessor relationship.

     


    Tag


    代码

    分治法。递归。pre引用节点。中序遍历。

    /*
    struct TreeNode {
    	int val;
    	struct TreeNode *left;
    	struct TreeNode *right;
    	TreeNode(int x) :
    			val(x), left(NULL), right(NULL) {
    	}
    };*/
    class Solution { 
    public:
        TreeNode* Convert(TreeNode* pRootOfTree)
        {
            if(!pRootOfTree) return nullptr;
            TreeNode* pre = nullptr;        
            Core(pRootOfTree,pre);
            
            while(pRootOfTree->left)
            {
                pRootOfTree = pRootOfTree->left;
            }
            return pRootOfTree;
        }
        //中序遍历。递归。
        void Core(TreeNode* root,TreeNode*& pre)
        {
            if(!root) return;//终止 
            
            //左
            Core(root->left,pre);
            if(pre)
            {
                pre->right=root;
                root->left=pre;
            }
            
            //根
            pre =root;
            
            //右
            Core(root->right,pre); 
        }
    };

    问题

  • 相关阅读:
    河北省重大技术需求征集七稿第二天
    河北省重大技术需求征集七稿第一天
    CNN网络架构演进
    C++学习-类域、友元、运算符重载、对象的生存期,可见域,作用域(2)
    C++学习-类域、友元、运算符重载、对象的生存期,可见域,作用域(1)
    C++学习-输入输出
    C++学习-new delete扩展
    C++学习-类和对象(2)
    C++学习-类和对象(1)
    C++学习-程序内存分配方式
  • 原文地址:https://www.cnblogs.com/lightmare/p/10463461.html
Copyright © 2011-2022 走看看