Skip to content

Instantly share code, notes, and snippets.

@Shivani13121007
Created January 15, 2022 04:49
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save Shivani13121007/77a0b8311b64679302b8fb43c9607360 to your computer and use it in GitHub Desktop.
Save Shivani13121007/77a0b8311b64679302b8fb43c9607360 to your computer and use it in GitHub Desktop.
Even Odd Tree
Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this question we print numbers in Increasing Order and Decreasing Order.
Question Name:
Even Odd Tree
Question Link:
https://nados.io/question/even-odd-tree
Question Statement:
A binary tree is named Even-Odd if it meets the following conditions:
The root of the binary tree is at level index 0, its children are at level index 1, their children are at level index 2, etc.
For every even-indexed level, all nodes at the level have odd integer values in strictly increasing order (from left to right).
For every odd-indexed level, all nodes at the level have even integer values in strictly decreasing order (from left to right).
Given the root of a binary tree, return true if the binary tree is Even-Odd, otherwise return false.
Topic: #Even Odd Tree #trees #binary Tree
#TimeComplexity: O(N)
#SpaceComplexity: O(N)
--------------------------------------------------------------
More Youtube PlayList:
Level 1 In Java English : https://www.youtube.com/playlist?list...
Level 1 In Java Hindi : https://www.youtube.com/playlist?list...
Level 2 In Java Hindi : https://www.youtube.com/playlist?list...
Constructive Algorithm - Level 3 : https://www.youtube.com/playlist?list...
Geometry - Level 3 : https://www.youtube.com/playlist?list...
Maths for CP - Level 3 : https://www.youtube.com/playlist?list...
DP - Level 3 : https://www.youtube.com/playlist?list...
Euler Tour - Level 3 : https://www.youtube.com/playlist?list...
Ternary Search : https://www.youtube.com/playlist?list...
Recursion & Backtracking - Level 1 : https://www.youtube.com/playlist?list...
Recursion & Backtracking - Level 2 : https://www.youtube.com/playlist?list...
Graphs - Level 1 : https://www.youtube.com/playlist?list...
Dyanmic Programming - Level 1 : https://www.youtube.com/playlist?list...
Generic Trees - Level 1 : https://www.youtube.com/playlist?list...
Time and Space - Level 1 : https://www.youtube.com/playlist?list...
---------------------------------------------------------------
Pepcoding has taken the initiative to provide counselling and learning resources to all curious, skillful and dedicated Indian coders. This video is part of the series to impart industry-level web development and programming skills in the community.
We also provide professional courses with live classes and placement opportunities.
For more free study resources and information about the courses, visit: https://www.pepcoding.com/resources/
Have a look at our result: https://www.pepcoding.com/placements
Follow us on our Youtube page: https://www.youtube.com/c/Pepcoding/f...
Follow us on our FB page: https://www.facebook.com/pepcoding
Follow us on Instagram: https://www.instagram.com/pepcoding
Follow us on LinkedIn: https://www.linkedin.com/company/pepc...
Follow us on Pinterest: https://in.pinterest.com/Pepcoding/_c...
Follow us on Twitter: https://twitter.com/home
.
.
.
Happy Programming !!! Pep it up
----------------------------------------------------------------
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment