Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Appearance settings

source coding is a little complex #493

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
varunu28 merged 2 commits into from
Aug 28, 2018
Merged

source coding is a little complex #493

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
28deddd
source coding is a little complex
JayH2018 Aug 28, 2018
2dc86b6
Update LevelOrderTraversal.java
varunu28 Aug 28, 2018
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 5 additions & 9 deletions 14 DataStructures/Trees/LevelOrderTraversal.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -37,14 +37,10 @@ int height(Node root)
return 0;
else
{
/* compute height of each subtree */
int lheight = height(root.left);
int rheight = height(root.right);

/* use the larger one */
if (lheight > rheight)
return(lheight+1);
else return(rheight+1);
/**
* Return the height of larger subtree
*/
return Math.max(height(root.left),height(root.right)) + 1;
}
}

Expand Down Expand Up @@ -75,4 +71,4 @@ public static void main(String args[])
System.out.println("Level order traversal of binary tree is ");
tree.printLevelOrder();
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.