Breaking News: Grepper is joining You.com. Read the official announcement!

Postorder Traversal

Hassan answered on January 30, 2021 Popularity 9/10 Helpfulness 1/10

answer Postorder Traversal

Postorder Traversal

Comment

# Assuming valid Binary Tree Node
def post_order(node: BinaryTreeNode):
    if node.left:
        post_order(node.left)
    if node.right:
        post_order(node.right)
    print(node.val)

Popularity 9/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: postorder python traversal

Link to this answer
Share Copy Link

Contributed on Jul 24 2023

Hassan

0 Answers Avg Quality 2/10

Closely Related Answers

inorder preorder postorder

Comment

preorder: parent => left => right
inorder: left => parent => right
postorder: left => right => parent

Popularity 10/10 Helpfulness 4/10 Language whatever

Source: Grepper

Tags: inorder

Link to this answer
Share Copy Link

Contributed on Jan 30 2021

QuietHumility

0 Answers Avg Quality 2/10

preorder traversal

Comments(1)

<> Preorder		Root -> Left -> Right 
<> Inorder		Left -> Root -> Right
<> Postorder	Left -> Right -> Root

Popularity 10/10 Helpfulness 4/10 Language javascript

Source: Grepper

Tags: depth-first-search depth-first-searc

Link to this answer
Share Copy Link

Contributed on Jan 09 2023

correctYourPosture

0 Answers Avg Quality 2/10

inorder preorder postorder

Comment

Hint to Remember: 
  IN means root is in middle: inorder: left => root => right 
  PRE means root is at front: preorder: root => left => right
  POST means root is at the end: postorder: left => right => root
Always left comes first than right

Popularity 10/10 Helpfulness 3/10 Language whatever

Source: Grepper

Tags: inorder

Link to this answer
Share Copy Link

Contributed on Sep 08 2022

Prajun Trital

0 Answers Avg Quality 2/10

inorder traversal of tree

Comment

//*******this is a C program for implementation and searching in A BT*******
#include<stdlib.h>
#include <stdio.h>

struct BinaryTree{
    int data;
    struct BinaryTree*right;
    struct BinaryTree*left;
};

struct BinaryTree*createnode(int val){
    struct BinaryTree*root=(struct BinaryTree*)malloc(sizeof(struct BinaryTree));
    root->data=val;
    root->left=NULL;
    root->right=NULL;
    
}

void inorder(struct BinaryTree*root){
    if(root==NULL){
    return;
    }
    else {inorder(root->left);
    printf("%d->",root->data);
    inorder(root->right);
}

}
 
void preorder(struct BinaryTree*root){
    if(root==NULL){
        return;
    }
    else {
        printf("%d->",root->data);
        preorder(root->left);
        preorder(root->right);
    }
}

void postorder(struct BinaryTree*root){
    if(root==NULL){
        return;
    }
    else{
        postorder(root->left);
        postorder(root->right);
        printf("%d->",root->data);
    }
}
int main()
{
    printf("Lets grow the tree\n");
    struct BinaryTree*root=createnode(1);
    root->left=createnode(2);
    root->right=createnode(3);
    root->left->left=createnode(4);
    root->left->right=createnode(5);
    
    printf("tree has grown up\n");
    
    printf("Inorder traversal ");
    inorder(root);printf("NULL");

    printf("\npreorder traversal ");
    preorder(root);printf("NULL");
    
    printf("\nPostorder  traversal");
    postorder(root);printf("NULL");
    
    return 0 ;
}

Popularity 10/10 Helpfulness 2/10 Language c

Source: Grepper

Tags: c

Link to this answer
Share Copy Link

Contributed on Aug 17 2022

Unusual Unicorn

0 Answers Avg Quality 2/10

Postorder traversal

Comment

class Solution {
    List<Integer> list = new ArrayList<>();
    public List<Integer> postorderTraversal(TreeNode root) {
        dfs(root);
        return list;
        
    }
     public void dfs(TreeNode root)
    {
        if(root!=null)
        {
            
            dfs(root.left);
            
            dfs(root.right);
            list.add(root.val);
        }
    }
}

Popularity 9/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: postorder post

Link to this answer
Share Copy Link

Contributed on Jun 22 2023

Zealous Zebra

0 Answers Avg Quality 2/10

Tree: Postorder Traversal

Comment

def postOrder(root):
    if root:
        postOrder(root.left)
        postOrder(root.right)
        print(root, end = " ")

Popularity 10/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: postorder post

Link to this answer
Share Copy Link

Contributed on Jun 18 2022

Grieving Gazelle

0 Answers Avg Quality 2/10

inorder preorder postorder

Comment

preorder: +ab
inorder: a+b
postorder: ab+
# Abhay Tiwari IITP

Popularity 9/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: inorder

Link to this answer
Share Copy Link

Contributed on Aug 13 2023

TAbhay

0 Answers Avg Quality 2/10

Preorder, inorder & postorder traversal code

Comments(1)

class Node:
    def __init__(self, k):
        self.left = None
        self.right = None
        self.key = k


def inorder(root):
    if root != None:
        inorder(root.left)
        print(root.key)
        inorder(root.right)


# Driver Code

root = Node(10)
root.left = Node(20)
root.right = Node(30)
root.right.left = Node(40)
root.right.right = Node(50)

inorder(root)

# time complexity (using recurrence tree method)  - O(n)
where, 
n == total nodes 
# space complexity - O(height of tree)
Note: height can be both n (if each node has exactly 1 child) and 
log(n) (if every node has exactly 2 children).

# IMP NOTE : FOR PREORDER AND POSTORDER JUST ORDER OF STATEMENTS CHANGE

for ex:
below is preorder & postorder traversal with same time & space complexity as inorder

def preorder(root):
    if root == None:
        return
    print(root.key)
    preorder(root.left)
    preorder(root.right)

def postorder(root):
    if root == None:
        return
    preorder(root.left)
    preorder(root.right)
    print(root.key)

Popularity 10/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: inorder

Link to this answer
Share Copy Link

Contributed on Aug 04 2022

ap_Cooperative_dev

0 Answers Avg Quality 2/10

Tree: Inorder Traversal

Comment

def inOrder(root):
    if root:
        inOrder(root.left)
        print(root, end = " ")
        inOrder(root.right)

Popularity 10/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: inorder

Link to this answer
Share Copy Link

Contributed on Jun 18 2022

Grieving Gazelle

0 Answers Avg Quality 2/10

Postorder Traversal

Contents

More Related Answers

Postorder Traversal

Closely Related Answers

inorder preorder postorder

preorder traversal

inorder preorder postorder

inorder traversal of tree

Postorder traversal

Tree: Postorder Traversal

inorder preorder postorder

Preorder, inorder & postorder traversal code

Tree: Inorder Traversal

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.