首页 > 代码库 > LeetCode:Flatten Binary Tree to Linked List
LeetCode:Flatten Binary Tree to Linked List
题目描述:
Given a binary tree, flatten it to a linked list in-place.
For example,
Given
1 / 2 5 / \ 3 4 6The flattened tree should look like:
1 2 3 4 5 6
代码:
void flatten(TreeNode *root) { if(root == NULL) return; stack<TreeNode *> treenode_stack; TreeNode * pre; TreeNode * next; pre = root; next = NULL; if(root->right != NULL) treenode_stack.push(root->right); if(root->left != NULL) treenode_stack.push(root->left); while(!treenode_stack.empty()) { TreeNode * node = treenode_stack.top(); treenode_stack.pop(); next = node; pre->right = next; pre->left = NULL; pre = node; if(node->right != NULL) treenode_stack.push(node->right); if(node->left != NULL) treenode_stack.push(node->left); } }
LeetCode:Flatten Binary Tree to Linked List
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。