程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> [LeetCode]Binary Tree Preorder Traversal

[LeetCode]Binary Tree Preorder Traversal

編輯:C++入門知識

[LeetCode]Binary Tree Preorder Traversal


 

Given a binary tree, return the preorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3

 

return [1,2,3].

Note: Recursive solution is trivial, could you do it iteratively?


只要是遞歸就能用棧來還原遞歸過程

 

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
	List res = new ArrayList<>();
	Stack stack = new Stack<>();
	public List preorderTraversal(TreeNode root) {
		if(root == null) return new ArrayList();
		stack.push(root);
		while(!stack.isEmpty()){
			TreeNode tn = stack.pop();
			res.add(tn.val);
			if(tn.right!=null){
				stack.push(tn.right);
			}
			if(tn.left!=null){
				stack.push(tn.left);
			}
		}
		return res;
	}
}


 

 

 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved