gistfile1.e

bst2array(tree : BST[G]; a : ARRAY[G]) is
    require
        tree /= Void
    do 
        -- Traverse the tree in-order
       
        if tree.left /= Void then
            -- Recursively add all the elements of the left subtree
            bst2array(tree.left, a)
        end

        -- Add the current element
        a.add_last(tree.value)

        if tree.right /= Void then
            -- Recursively add all the elements of the right subtree
            bst2array(tree.right, a)
        end
    end