1.Can you construct a tree using postorder and preorder traversal?

Add comment

Votes: 0

Comments: 0

Consider 2 trees below

Tree1

a
b

Tree 2

a
b

preorder = ab
postorder = ba

Preorder and postorder do not uniquely define a binary tree. Nor do preorder and level order (same example). Nor do postorder and level order.

Others in this Category

	Q: 6. What do you accomplish by GROUP BY .... HAVING clause?
	Q: What is the meaning of underscore ( ‘_’ ) in the LIKE statement?
	What is a threaded binary tree?
	Q: What is the COBOL picture clause for a DB2 column defined as DECIMAL(11,2)?
	What is a threaded binary tree?
	Q: What is 'LIKE' used for in WHERE clause? What are the wildcard characters?
	Find the closest ancestor of two nodes in a tree.
	How many different trees can be constructed using n nodes?
	A full N-ary tree has M non-leaf nodes, how many leaf nodes does it have?
	What is an AVL tree?
	» More articles