leetcode

Leetcode submissions
git clone git://git.laack.co/leetcode.git
Log | Files | Refs | README

binary-tree-traversal.dart (587B)

      1 //This is a recursive solution to print out the values
      2 //in a binary tree inorder. The time complexity of this
      3 //is O(n) where n is the number of nodes in the tree.
      4 //Runtime:274ms Beats: 43.59%
      5 //Memory: 139.9MB Beats: 69.23%
      6 
      7 class TreeNode {
      8   int val;
      9   TreeNode? left;
     10   TreeNode? right;
     11 }
     12 
     13 class Solution {
     14   List<int> vals = [];
     15   List<int> inorderTraversal(TreeNode? root) {
     16       recurse(root);
     17       return vals;
     18   }
     19 
     20  void recurse(TreeNode? node){
     21      if(node == null){
     22          return;
     23      }
     24      recurse(node.left);
     25      vals.add(node.val);
     26      recurse(node.right);
     27  }
     28 }