32/100. Binary Tree Inorder Traversal
中序遍历二叉树。
递归法:
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = Noneclass Solution(object):def __init__(self):self.res = []def inorderTraversal(self, root):""":type root: TreeNode:rtype: List[int]"""if not root:return []self.inorderTraversal(root.left)self.res.append(root.val)self.inorderTraversal(root.right)return self.res
迭代法:
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = Noneclass Solution(object):def inorderTraversal(self, root):""":type root: TreeNode:rtype: List[int]"""if not root:return []pNode = rootstack = []res = []while pNode or stack:while pNode: #①迭代,直到找到最左的叶节点;②非空右节点stack.append(pNode)pNode = pNode.left#pNode为空pNode = stack.pop()res.append(pNode.val)pNode = pNode.rightreturn res
32/100. Binary Tree Inorder Traversal相关推荐
- LeetCode 94. Binary Tree Inorder Traversal
94. Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes' va ...
- 【二叉树迭代版中序遍历】LeetCode 94. Binary Tree Inorder Traversal
LeetCode 94. Binary Tree Inorder Traversal Solution1:递归版 二叉树的中序遍历递归版是很简单的,中序遍历的迭代版需要特殊记一下! 迭代版链接:htt ...
- 15 二叉树的中序遍历(Binary Tree Inorder Traversal)
文章目录 1 题目 2 描述 3 解决方案 3.1 递归算法 3.1.1 遍历法(Traverse) 思路 源码 3.1.2 分治法(Devide And Conquer) 思路 源码 3.2 非递归 ...
- [LeetCode]:94:Binary Tree Inorder Traversal
题目: Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binar ...
- LintCode: Binary Tree Inorder Traversal
C++,递归,辅助函数 1 /** 2 * Definition of TreeNode: 3 * class TreeNode { 4 * public: 5 * int val; 6 * Tree ...
- LeetCode Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tr ...
- Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tr ...
- leetcode[94]Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tr ...
- [swift] LeetCode 94. Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tr ...
最新文章
- 序列化和反序列化的几种方式(DataContractSerializer)(二)
- 跳石头 NOIP2015 提高组 Day2 T1
- include(),include_once(),requice(),require_once()的区别
- 一个不经意的问题引发的小思考
- 给指定的某个commit号加tag并推送
- 大数据学习系列----基于Spark Streaming流式计算
- 使用阿里云镜像仓库构建国外 Docker 镜像
- tp5 自定义配置文件
- 32岁了,我有机会转行做程序员吗?——Leo网上答疑(1)
- 题目:[汪老师结婚]婚礼上的袭击
- Putty 保存账号密码
- 手机支付宝密码存储机制分析
- 股票历史数据-股票历史数据在线查询系统
- 北邮教授石川:图神经网络需要解决的几个关键问题
- Visio中的内容另存为图片且不改变画质
- linux变量符号生效规则,shell的变量功能
- CVPR2022: Oriented RepPoints论文模型实践(用dota数据集)
- 无线城域网 WiMax 仿真实验
- “操作必须使用一个可更新的查询”故障解决
- 阿里女高管向马云道歉,她到底做了什么?