Self Doubt

ankit_thawal asked Jan 19, 2018

219 views

1 votes

Given Only one of the traversal(pre,post,in) can we identify other remaining traversals using given traversals.

AND if not, can we Atleast cross check from optio s given(trial and error method).

ankit_thawal asked Jan 19, 2018

ankit_thawal

219 views

See all

2 2 Comments

chandra sai

commented Jan 19, 2018

we need (in,pre) or (in,post) atleast to find the other traversal.

we cant find Inorder with pre&post.

verifying options works only if single option matches

0 votes

Ashwin Kulkarni

commented Jan 19, 2018

If the given tree is BST then its inorder will be in asc order hence from given pre or post order only we can find other but only in BST!

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

1 answer

Gopal6854 asked Sep 13, 2023

333 views

Self doubt
#include <stdio.h> void SSort(int [], int); void swap(int *,int*); int main() { int arr[] = {5,4,3,2,1,0}; int n = sizeof(arr)/sizeof(arr[0]); SSort(arr,n); for(int i = 0; i < n; i++) { printf("%d\t", arr[i]); } return 0; } void SSort( ... = *x; *x = *y; *y = tmp; } This is a selection sort algorithm. But the output of the algo is: 0 0 0 0 0 0. Where is the problem ?

#include <stdio.h>void SSort(int [], int);void swap(int *,int*);int main() { int arr[] = {5,4,3,2,1,0}; int n = sizeof(arr)/sizeof(arr[0]); SSort(arr,n); for(...

Gopal6854

333 views

Gopal6854 asked Sep 13, 2023

DS
sorting
self-doubt
algorithms

+ –

0 votes

1 answer

viral8702 asked Jul 22, 2023

322 views

Self Doubt
I have a doubt on simple Queue Implementation by an array Assume Queue is full(of n size),Front is pointing to first element and Rear is pointing to last element If we dequeue the element then front's element will get deleted, Now do we have to ... space is empty) I am not talking about circular queue concept,I am just talking about simple queue implementation using array(Not circular).

I have a doubt on simple Queue Implementation by an arrayAssume Queue is full(of n size),Front is pointing to first element and Rear is pointing to last elementIf we dequ...

viral8702

322 views

viral8702 asked Jul 22, 2023

DS
queue
self-doubt
data-structures

+ –

0 votes

1 answer

gagan55 asked Jul 13, 2023

937 views

self-doubt Data structure Linked list. Inserting a node at the beginning of a linked list
How to Visualize this code ? #include<stdio.h> #include<stdlib.h> struct node{ int data; struct node *next; }; void addFirst(struct node **head,int val){ struct node *newNode =malloc(sizeof(struct node ... ); addFirst(&head,30); addFirst(&head,40); addFirst(&head,50); printList(head); }

How to Visualize this code ?#include<stdio.h #include<stdlib.h struct node{ int data; struct node *next; }; void addFirst(struct node head,int val){ struct node *newNode...

gagan55

937 views

gagan55 asked Jul 13, 2023

DS
data-structures
linked-list

+ –

0 votes

1 answer

Abhrajyoti00 asked Oct 29, 2022

737 views

Self-Doubt: Stack Overflow in LinkedList
Can there be “Stack Overflow” in Linked list Implementation of stack? If Yes, how?

Can there be “Stack Overflow” in Linked list Implementation of stack? If Yes, how?

Abhrajyoti00

737 views

Abhrajyoti00 asked Oct 29, 2022

DS
stack
data-structures
linked-list

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

2 2 Comments reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

2 2 Comments