二叉树
newhonor
可以不伟大,但不能卑微
展开
-
L2-004 这是二叉搜索树吗?
在PTA关闭同步流会wa=-=#include<algorithm>#include<set>#include<vector>#include<queue>#include<cmath>#include<cstring>#include<iostream>#include<al原创 2019-03-18 15:47:35 · 308 阅读 · 0 评论 -
L2-006 树的遍历
层序:顶层往下,一层一层,从左到有;前序遍历:1.访问根节点 2.前序遍历左子树 3.前序遍历右子树中序遍历:1.中序遍历左子树 2.访问根节点 3.中序遍历右子树后序遍历:1.后序遍历左子树 2.后序遍历右子树 3.访问根节点#include<algorithm>#include<set>#in...原创 2019-03-18 19:15:53 · 236 阅读 · 0 评论 -
L2-011 玩转二叉树
L2-006树的遍历差不多#include<algorithm>#include<set>#include<vector>#include<queue>#include<cmath>#include<cstring>#include<iostream>#include<algori...原创 2019-03-18 20:07:42 · 112 阅读 · 0 评论 -
递归&&栈建立二叉树+先序,后序,中序,叶子数,节点数
#include<algorithm>#include<set>#include<vector>#include<queue>#include<cmath>#include<cstring>#include<iostream>#include<algorithm>#include<...原创 2019-03-31 21:24:05 · 355 阅读 · 0 评论