Question 2 Write a function that accepts root of a binary tree and print zigzag level order traversal, each level print in new line.For example,Given tree:12 34 5 6 78 9output:12 37 6 5 48 9[advanced_iframe securitykey=”undefined” src=”https://code.kodnest.com/” width=”100%” height=”600″] Previous Next