Skip to content

Conversation

nazmulwanted
Copy link
Owner

No description provided.

@nazmulwanted nazmulwanted requested a review from Sadman007 June 9, 2022 01:00
@@ -0,0 +1,7 @@
// Time complexity: O(N), N = Number of nodes
// Space complexity: O(1)
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Space complexity is O(H), where H = max depth of the tree. It is because of the stack memory used by the recursion.

@@ -0,0 +1,16 @@
// Time complexity: O(N), N = Number of nodes
// Space complexity: O(1)
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Space complexity is O(H), where H = max depth of the tree. It is because of the stack memory used by the recursion.

@@ -0,0 +1,15 @@
// Time complexity: O(N), N = Number of nodes;
// Space complexity: O(1)
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Space complexity is O(H), where H = max depth of the tree. It is because of the stack memory used by the recursion.

@@ -0,0 +1,11 @@
// Time complexity: O(N) , N = Number of nodes.
// Space complexity: O(1).
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Space complexity is O(H), where H = max depth of the tree. It is because of the stack memory used by the recursion.

Copy link
Collaborator

@Sadman007 Sadman007 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@nazmulwanted

Need to work on complexity analysis.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants