public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<Integer>();
Stack<TreeNode> st = new Stack<TreeNode>();
TreeNode current = root;
while(current != null || !st.isEmpty())
{
if(current != null)
{
result.add(current.val);//Add parent
st.push(current.right);
current = current.left;
}
else
{
current = st.pop();
}
}
return result;
}
[leetcode] Binary Tree Preorder Traversal
最新推荐文章于 2024-05-31 10:46:10 发布