Two elements of a binary search tree (BST) are swapped by mistake.
Given two binary trees, write a function to check if they are the same or not.
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
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 ...
Given preorder and inorder traversal of a tree, construct the binary tree.
Given inorder and postorder traversal of a tree, construct the binary tree.
Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).
Given a binary tree, return the inorder traversal of its nodes’ values.
注：总结不易，如需转载请注明出处：https://www.cnblogs.com/zhuchenglin/p/15094296.html
