invert-binary-tree 1.0.0
Invert Binary Tree
Loading...
Searching...
No Matches
Solution Class Reference

Public Member Functions

TreeNodeinvertTree (TreeNode *root)
 

Detailed Description

Definition at line 18 of file main.cpp.

Member Function Documentation

◆ invertTree()

TreeNode * Solution::invertTree ( TreeNode root)
inline

Definition at line 21 of file main.cpp.

22 {
23 if (root == nullptr)
24 return nullptr;
25 queue<TreeNode*> q;
26 q.push(root);
27 while (!q.empty())
28 {
29 TreeNode* current = q.front();
30 q.pop();
31 TreeNode* tmp = current->left;
32 current->left = current->right;
33 current->right = tmp;
34 if (current->left)
35 q.push(current->left);
36 if (current->right)
37 q.push(current->right);
38 }
39 return root;
40 }
Definition for a binary tree node.
Definition main.cpp:9
TreeNode * left
Definition main.cpp:11
TreeNode * right
Definition main.cpp:12

References TreeNode::left, and TreeNode::right.


The documentation for this class was generated from the following file: