You are given a tree with n vertices. Review that a tree is an associated undirected diagram without cycles. We consider a tree a Fib-tree, if its number of vertices rises to Fk for some k, and somewhere around one of the accompanying conditions holds: The tree comprises of just 1 vertex;
Correct answer will be upvoted else downvoted. Computer science.
You are given a tree with n vertices. Review that a tree is an associated undirected diagram without cycles.
We consider a tree a Fib-tree, if its number of vertices rises to Fk for some k, and somewhere around one of the accompanying conditions holds:
The tree comprises of just 1 vertex;
You can isolate it into two Fib-trees by eliminating some edge of the tree.
Decide if the given tree is a Fib-tree or not.
Input
The main line of the input contains a solitary integer n (1≤n≤2⋅105) — the number of vertices in the tree.
Then, at that point, n−1 lines follow, every one of which contains two integers u and v (1≤u,v≤n, u≠v), addressing an edge between vertices u and v. It's dependable that given edges structure a tree.
Output
Print "YES" if the given tree is a Fib-tree, or "NO" in any case.
You can print your reply regardless. For instance, assuming the appropriate response is "YES", the output "Yes" or "yeS" will likewise be considered as right reply.
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)