<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Upfront的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Upfront</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Upfront]]></copyright><item><title><![CDATA[阿里云ECS mysql安装和远程连接]]></title><link>https://blog.youkuaiyun.com/Upfront/article/details/123919312</link><guid>https://blog.youkuaiyun.com/Upfront/article/details/123919312</guid><author>Upfront</author><pubDate>Sat, 02 Apr 2022 14:33:30 +0800</pubDate><description><![CDATA[1.升级升级apt-get：


apt-get update
sudo apt-get update

2.查看是否安装mysql：


sudo netstat -tap|grep mysql

如果没有输出 则表明没有装mysql



3.安装：


apt-get install mysql-server
apt-get install mysql-client
apt-get install libmysqlclient-dev

过程中可以全部选择y



4.


vim /etc/mysq]]></description><category></category></item><item><title><![CDATA[二叉树遍历]]></title><link>https://blog.youkuaiyun.com/Upfront/article/details/120678850</link><guid>https://blog.youkuaiyun.com/Upfront/article/details/120678850</guid><author>Upfront</author><pubDate>Sun, 10 Oct 2021 11:23:33 +0800</pubDate><description><![CDATA[零、基础知识：

    ①前序遍历

前序遍历首先访问根节点，然后遍历左子树，最后遍历右子树。





    ②中序遍历

中序遍历是先遍历左子树，然后访问根节点，然后遍历右子树。



    ③后序遍历

后序遍历是先遍历左子树，然后遍历右子树，最后访问树的根节点。





一、递归法

    ①前序遍历


class Solution {
    publ...]]></description><category></category></item></channel></rss>