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); 
        }
    };

    问题

  • 相关阅读:
    Spring MVC 完全注解方式配置web项目
    spring WebServiceTemplate 调用 axis1.4 发布的webservice
    修改Intellij Idea 创建maven项目默认Java编译版本
    Git Commit提交规范和IDEA插件Git Commit Template的使用
    myEclipse10安装以及破解
    ES6中Map与其他数据结构的互相转换
    ES6用来判断数值的相关函数
    WebStorm使用码云插件问题
    Css解决表格超出部分用省略号显示
    Js/Jquery获取网页屏幕可见区域高度
  • 原文地址:https://www.cnblogs.com/lightmare/p/10463461.html
Copyright © 2011-2022 走看看