Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. 根据先序和中序遍历还原二叉树。 思...

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 a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree [3,9,20,...

Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [3...

Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [1,...

题目：Binay Tree Level Order TraversalGiven a binary tree, return the level order traversal of its nod

题目：Binary Tree Preorder Traversal二叉树的前序遍历，同样使用栈来解，代码如下： 1 struct TreeNode { 2 int val; 3 TreeNode* left; 4 TreeNode* right; 5......

题目：Binary Tree Inorder Traversal二叉树的中序遍历，和前序、中序一样的处理方式，代码见下： 1 struct TreeNode { 2 int val; 3 TreeNode* left; 4 TreeNode* righ......