Inorder traversal

by rishul matta

JavaScript

function inorderTraversal(A){
        var arr = [];
        
        function inOrder(node) {
            if (node == null) {
                return;
            }
            
            inOrder(node.left);
            arr.push(node.data);
            inOrder(node.right);
        }
        inOrder(A)
        return arr;
	}
  
  
  // Definition for a  binary tree node
//    function TreeNode(data){
//      this.data = data
//      this.left = null
//      this.right = null
//    }