Add Morris Inorder Traversal for a Binary Tree inside the Doc

HackClubRAIT / Wizard-Of-Docs

A open source project to bring all the data structures and algorithms docs under one repository.

MIT License

19 stars 42 forks source link

Add Morris Inorder Traversal for a Binary Tree inside the Doc #135

Open sid-am-ahd935 opened 2 years ago

sid-am-ahd935 commented 2 years ago

Description

Recursively, anyone can traverse the binary tree but it takes O(N) time and O(N) space [function call stack]. To reduce the space complexity, Morris Traversal is used.

Programming language

[x] C++
[x] Python

Are you contributing under any open-source program ?

Hackclub RAIT Summer of Code

sid-am-ahd935 commented 2 years ago

Hi @Chaitalishetty can you please assign this issue to me?

Chaitalishetty commented 2 years ago

@sid-am-ahd935 Assigning you this issue. Happy Coding !