问题：
方法：
中序遍历，看码吧。
package com.eric.leetcode
class BinaryTreeInorderTraversal {
private val result = mutableListOf<Int>()
fun inorderTraversal(root: TreeNode?): List<Int> {
result.clear()
dfs(root)
return result
}
private fun dfs(root: TreeNode?) {
if (root == null) {
return
}
dfs(root.left)
result.add(root.`val`)
dfs(root.right)
}
}
有问题随时沟通
94. Binary Tree Inorder Traversal Binary Tree Inorder Tra...
问题： 方法：中序遍历，看码吧。 有问题随时沟通 具体代码实现可以参考Github[https://github....
106. Construct Binary Tree from Inorder and Postorder Tra...
T105. Construct Binary Tree from Preorder and Inorder Tra...
Problem https://leetcode.com/problems/binary-tree-inorder...
https://leetcode.com/problems/binary-tree-inorder-travers...
LeetCode 0106. Construct Binary Tree from Inorder and Pos...
94. Binary Tree Inorder Traversal 题目:https://leetcode.com...
https://leetcode-cn.com/problems/binary-tree-inorder-trav...
https://leetcode-cn.com/problems/binary-tree-inorder-trav...
本文标题：LeetCode之Binary Tree Inorder Tra
本文链接：https://www.haomeiwen.com/subject/sxbfgltx.html
网友评论