Welcome To Ask or Share your Answers For Others

二叉树中序遍历，求教

asked Jan 27, 2021 in Technique[技术] by 深蓝 (71.8m points)

给定一个二叉树，返回它的中序?遍历。
输入: [1,null,2,3]
   1
    
     2
    /
   3

输出: [1,3,2]

与恶龙缠斗过久,自身亦成为恶龙；凝视深渊过久,深渊将回以凝视…

2.1k views

Welcome To Ask or Share your Answers For Others

1 Answer

answered Jan 27, 2021 by 深蓝 (71.8m points)

百度一下你就知道。这个是二叉树最基础的

与恶龙缠斗过久,自身亦成为恶龙；凝视深渊过久,深渊将回以凝视…

...