Register

BINARY TREE

• edited by
1,512 views
1 1 vote
A rooted tree with 8 nodes has its nodes [1.....8] in preorder.When the tree is traversed in postorder.....nodes visited are

{3,5,4,2,7,8,6,1}.

Draw a  tree for it.

How to solve .....someone please explain?

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · Testbook Test SeriesNext → · ambiguous grammar
← Previous in category · BST treeNext in category → · stackk
Position:
Show:

Related questions

10 10 votes
1 1 answer
333
333 views
GO Classes asked Jul 28
333 views
GO Classes DPP | GATE CS, DA | Data Structure | Binary Tree Traversals
A binary tree has:$1000$ nodes in the left subtree $100$ nodes in the right subtreeHow many nodes are processed before the root in preorder, inorder, and postorder traver...
7 7 votes
1 1 answer
204
204 views
GO Classes asked Jul 13
204 views
GO Classes DPP | GATE CS | Data Structure | Binary Tree Nodes
Which of the following functions correctly returns the total number of nodes in a binary tree rooted at $\texttt{t}$?int tree_size(TreeNode *t) { if (t == NULL) return 0;...
11 11 votes
1 1 answer
254
254 views
GO Classes asked Jul 11
254 views
GO Classes DPP | GATE CS | Data Structures | Complete Binary Tree
Which of the following can be the number of nodes in a complete binary tree?$2$ $5$ $7$ $8$
6 6 votes
1 1 answer
210
210 views
GO Classes asked Jul 11
210 views
GO Classes DPP | GATE CS, DA | Data Structure | Full Binary Tree
Is it possible to construct a full binary tree with exactly $8$ internal nodes and $7$ leaves?Yes No