Traverse Tree iteratively
来源:互联网 发布:直播网站源码 编辑:程序博客网 时间:2024/06/16 10:51
Inorder Tree Traversal without recursion and without stack!
Using Morris Traversal, we can traverse the tree without using stack and recursion. The idea of Morris Traversal is based on Threaded Binary Tree. In this traversal, we first create links to Inorder successor and print the data using these links, and finally revert the changes to restore original tree.
1. Initialize current as root 2. While current is not NULL If current does not have left child a) Print current’s data b) Go to the right, i.e., current = current->right Else a) Make current as right child of the rightmost node in current's left subtree b) Go to this left child, i.e., current = current->left
Although the tree is modified through the traversal, it is reverted back to its original shape after the completion. Unlike Stack based traversal, no extra space is required for this traversal.
#include<stdio.h>#include<stdlib.h> /* A binary tree tNode has data, pointer to left child and a pointer to right child */struct tNode{ int data; struct tNode* left; struct tNode* right;}; /* Function to traverse binary tree without recursion and without stack */void MorrisTraversal(struct tNode *root){ struct tNode *current,*pre; if(root == NULL) return; current = root; while(current != NULL) { if(current->left == NULL) { printf(" %d ", current->data); current = current->right; } else { /* Find the inorder predecessor of current */ pre = current->left; while(pre->right != NULL && pre->right != current) pre = pre->right; /* Make current as right child of its inorder predecessor */ if(pre->right == NULL) { pre->right = current; current = current->left; } /* Revert the changes made in if part to restore the original tree i.e., fix the right child of predecssor */ else { pre->right = NULL; printf(" %d ",current->data); current = current->right; } /* End of if condition pre->right == NULL */ } /* End of if condition current->left == NULL*/ } /* End of while */} /* UTILITY FUNCTIONS *//* Helper function that allocates a new tNode with the given data and NULL left and right pointers. */struct tNode* newtNode(int data){ struct tNode* tNode = (struct tNode*) malloc(sizeof(struct tNode)); tNode->data = data; tNode->left = NULL; tNode->right = NULL; return(tNode);} /* Driver program to test above functions*/int main(){ /* Constructed binary tree is 1 / \ 2 3 / \ 4 5 */ struct tNode *root = newtNode(1); root->left = newtNode(2); root->right = newtNode(3); root->left->left = newtNode(4); root->left->right = newtNode(5); MorrisTraversal(root); getchar(); return 0;}
0 0
- Traverse Tree iteratively
- [LeetCode] Symmetric Tree - Iteratively
- Tree Traverse
- [LeetCode] Binary Tree Inorder Traversal - Iteratively
- Tree Preorder, Inorder, and Postorder Iteratively Summarization
- Tree -- Traverse & DFS & BFS
- Tree Traverse & BST
- Traverse binary tree by level
- Simple Tree Traverse(遍历)
- leetCode . Binary Tree Inorder/ Preorder/ Post Traversal iteratively
- post Order Tree traverse - finally AC
- Inorder - Tree - traverse - recursive and not recursive
- [Leetcode] Postorder Traverse of Binary Tree
- leetcode之Binary Tree Level Order Traverse
- How to traverse a directory tree
- Data Structure: How to traversal Binary Tree Iteratively (Preorder, Inorder and Postorder)
- Traverse a binary tree in a level-based order
- 二叉树非递归遍历算法Binary Tree Traverse methods
- c# 排行榜 自动排序
- stm32 窗口看门狗学习(一)
- android 安全问题
- 小飞鱼软件 通达OA工作流超时自动转交程序(图文)
- Remove Duplicates from Sorted Array - Leetcode
- Traverse Tree iteratively
- android 在xml中指定按钮点击事件
- Remove Duplicates from Sorted Array II - Leetcode
- OpenGL es2.0 创建颜色线圆
- JAVA学习知识点1.24之SpringMVC学习Day03
- cf287 Breaking Good
- sbobet เพื่ออนาคตที่ดี
- HTML5教程——【探秘腾讯,连接一切】
- 杭电OJ 1001