Leetcode每日随机2021/4/11

题

思

这题也没啥好说的，就是中序遍历一遍就完事儿了。

代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    private List<TreeNode> list = new ArrayList<TreeNode>();

	public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {
		dfs(root);
		for (int i = 0; i < list.size() - 1; i++) {
			if (list.get(i) == p) {
				return list.get(i + 1);
			}
		}
		return null;
	}

	private void dfs(TreeNode root) {
		if (root != null) {
			if (root.left != null) {
				dfs(root.left);
			}
			list.add(root);
			if (root.right != null) {
				dfs(root.right);
			}
		}
	}
}