search

Google-Developer-Student-Club-CCOEW / Competitive-Coding

7 stars 52 forks source link

Question 41 #64

Closed komalvhanmane closed 2 years ago

komalvhanmane commented 2 years ago

Given the root of a perfect binary tree, reverse the node values at each odd level of the tree.

For example, suppose the node values at level 3 are [2,1,3,4,7,11,29,18], then it should become [18,29,11,7,4,3,1,2]. Return the root of the reversed tree.

A binary tree is perfect if all parent nodes have two children and all leaves are on the same level.

The level of a node is the number of edges along the path between it and the root node.

Input: root = [2,3,5,8,13,21,34] Output: [2,5,3,8,13,21,34] Explanation: The tree has only one odd level. The nodes at level 1 are 3, 5 respectively, which are reversed and become 5, 3.

niteshjeganathan commented 2 years ago

Hi, I would like to take this up. I can code this in C++, C or any other language you would like. Please do assign this to me. Myself Nitesh Jeganathan from Vellore Institute of Technology, Vellore. 2nd Year. Btech CSE Core. @komalvhanmane

gaurijoshi22 commented 2 years ago

Gauri Joshi Cummins College of Engineering for Women, Pune Dept- Information Technology SY I would like to work on this issue Can you please assign me this issue?

OjaswiPande commented 2 years ago

OJASWI PANDE COMP SY CCOEW Can you assign this issue to me?

kasturimandlik commented 2 years ago

Kasturi Mandlik Cummins college of engineering for women Dept: Electronics and telecommunication I would like to work on this issue. Can you please assign me this issue?

komalvhanmane commented 2 years ago

@kasturimandlik I have assigned you this issue . Work on it :)