題目傳送:https://leetcode.cn/problems/binary-tree-inorder-traversal/
運作效率:
/**
* 傳回中序周遊結果
*
* @param root
* @return
*/
//遞歸解法
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<>();
//處理邊界情況
if (root == null) {
return result;
}
List<Integer> leftList = inorderTraversal(root.left);
result.addAll(leftList);
result.add(root.val);
List<Integer> rightList = inorderTraversal(root.right);
result.addAll(rightList);
return result;
}