94. Binary Tree Inorder Traversal

作者：璃夕KaSyow₠│2019-12-12 15:14:20│巴幣：0│人氣：86

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

/**
* Definition for a binary tree node.
* class TreeNode {
*     public $val = null;
*     public $left = null;
*     public $right = null;
*     function __construct($value) { $this->val = $value; }
* }
*/
class Solution {

    /**
     * @param TreeNode $root
     * @return Integer[]
     */
    public $res ;
    function inorderTraversal($root) {
        $this->res = array();
        $this->LTR($root) ;
        return $this->res ;
    }
    function LTR($r){
        if( $r->left != null ){
            $this->LTR($r->left) ;
        }
        array_push($this->res,$r->val) ;
        if( $r->right !=null ){
            $this->LTR($r->right) ;
        }
    }
}

Runtime: 8 ms

Memory Usage: 14.9 MB

喜歡收藏引用留言推上首頁檢舉

引用網址：https://home.gamer.com.tw/TrackBack.php?sn=4618970
All rights reserved. 版權所有，保留一切權利

相關創作