struct TreeNode* invertTree(struct TreeNode* root)
{ if ( NULL == root )
{
return NULL;
} if ( NULL == root->left && NULL == root->right )
{
//叶子节点
return root;
} //交换左右子节点
struct TreeNode * pTreeNodeTmp = root->left; root->left = root->right;
root->right = pTreeNodeTmp; invertTree(root->left);
invertTree(root->right); return root;
}
相关文章
- 96. Unique Binary Search Trees (Tree; DP)
- [LeetCode] Graph Valid Tree 图验证树
- LeetCode 81 Search in Rotated Sorted Array II [binary search]
- 145.Binary Tree Postorder Traversal---二叉树后序非递归遍历
- [LeetCode]题解(python):101 Symmetric tree
- [LeetCode] 124. Binary Tree Maximum Path Sum_ Hard tag: DFS recursive, Divide and conquer
- 剑指offer从上往下打印二叉树 、leetcode102. Binary Tree Level Order Traversal(即剑指把二叉树打印成多行、层序打印)、107. Binary Tree Level Order Traversal II 、103. Binary Tree Zigzag Level Order Traversal(剑指之字型打印)
- hdu 6161--Big binary tree(思维--压缩空间)
- Verify Preorder/Inorder/Postorder Sequence in Binary Search Tree
- [leetcode-663-Equal Tree Partition]