## Symmetric Tree

QUESTION Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). This question is provided by Leetocode.

QUESTION Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). This question is provided by Leetocode.

QUESTION Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which represents the number 123. Find the total sum of all root-to-leaf numbers. This question is provided by Leetocode.

Question Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value. This question is provided by LeetCode.

Question Given a binary tree, flatten it to a linked list in-place. This question is provided by LeetCode.

QUESTION Given inorder and prestorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. This question is provided by LeetCode.

QUESTION Given inorder and postorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. This question is provided by LeetCode.

QUESTION Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between). This question is provided by LeetCode.

QUESTION Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. This question is provided by LeetCode.

QUESTION Follow up for problem “Populating Next Right Pointers in Each Node”. What if the given tree could be any binary tree? Would your previous solution still work? This question is provided by LeetCode.

QUESTION Given a binary tree

1 2 3 4 5 |
struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } |

Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL. Initially, all next pointers are set to NULL. Note: You may only use constant extra space. You may assume that it is a Read the full article…