reverse binary tree c

Filip Výrostko answered on April 16, 2022 Popularity 8/10 Helpfulness 4/10

answer reverse binary tree c

related reverse binary tree c

related How to reverse a binary tree?

reverse binary tree c

Comment

// For embeded systems, dont use recursion, use stack (or queue) instead
// For more details check https://iq.opengenus.org/invert-binary-tree/

/*
typedef struct stack {
	stack_node_t* top;
} stack_t;

typedef struct stack_node {
	tree_node_t* t_node;	// Value of the stack node
    stack_node_t* next;
}stack_node_t;
*/

// What else you will likely need
stack_t* init_stack();
void stack_push();
tree_node_t* stack_pop();


void reverse_tree(tree_node_t* root) {
	
	if (root != NULL) {

      stack_t* stack = init_stack();	// Initialize stack
      tree_node_t* node, temp;	// Binary tree nodes


      while (stack->top != NULL) {
        
        // Dont forget to free the stack node inside the stack_pop()
		node = stack_pop(stack);

        temp = node->left_child;
        node->left_child = node->right_child;
        node->right_child = temp;

        if ( node->left_child != NULL ) stack_push (stack, node->left_child);

        if ( node->right_child != NULL ) stack_push (stack, node->rigth_child);


      }
		
      free(stack);
      
	}


}

Popularity 8/10 Helpfulness 4/10 Language c

Source: Grepper

Tags: binary-tree c reverse

Link to this answer
Share Copy Link

Contributed on Apr 17 2022

Filip Výrostko

0 Answers Avg Quality 2/10

Closely Related Answers

reverse binary tree c

Comment

void reverse_tree(tree_node_t* root) {
	
    if (root != NULL) {
    	
        // Reverse left and right sub-tree
        reverse_tree(root->left_child);
        reverse_tree(root->right_child);
        
        // Reverse two child nodes
        tree_node_t *temp = root->right_child;
        root->right_child = root->left_child;
        root->left_child  = temp;
        
	}

}

Popularity 8/10 Helpfulness 4/10 Language c

Source: Grepper

Tags: binary-tree bina

Link to this answer
Share Copy Link

Contributed on Apr 16 2022

Filip Výrostko

0 Answers Avg Quality 2/10