Making binary tree traversals lazy.

[amirsoroush]

Feature description

Hi,
In binary_tree_traversals.py file, there are different kinds of traversals such as preorder, inorder, postorder and etc.

Although the implementations are pretty clean one-liner like:

# preorder
return [root.data, *preorder(root.left), *preorder(root.right)] if root else []

It isn't memory friendly. We can use generators instead not to load all the nodes into the memory:

# preorder
    if not root:
        return []
    yield root.data
    yield from preorder(root.left)
    yield from preorder(root.right)

Shall we go ahead and change them?

[spam-1008]

+1

[rohan472000]

Absolutely, it's a great idea to switch from list-based traversals to generator-based traversals in the binary_tree_traversals.py file. Using generators instead of lists will indeed make the traversals more memory-friendly, especially for large trees.

[dev-soni-07]

@amirsoroush Please assign this task to me.

[tianyizheng02]

@digital-dev-07 Read the contributing guidelines.

If you are interested in resolving an open issue, simply make a pull request with your proposed fix. We do not assign issues in this repo so please do not ask for permission to work on an issue.