What do you get when you perform an inorder traversal of a binary search tree? H

Question

What do you get when you perform an inorder traversal of a binary search tree? How many nodes are there in a perfect binary tree of level n? How many ancestors does a node at level n in a binary tree have? What is the maximum number of leaves in a binary tree of level n? Under what conditions will the root of a binary search tree be enumerated last in an inorder traversal? If the data fields of a binary search tree are written to a file using an inorder traversal, and then the binary search tree is rebuilt from the file, will the new tree be as well balanced as the original tree? Would the new tree in the previous question be an exact copy of the original tree if the original tree had been copied to the file using one of the other traversals? If so, which one? Consider a perfect binary search tree of n nodes. Which of the following best describes the number of nodes that must be examined, in the worst case, to determine whether a given value is stored in the tree? a) O (n/2) b) O (log n) c) O (n) d) O (n log n) e) O (n^2)

Explanation / Answer

When we perform inorder traversal of the binary tree suppose on the expression

we can get the exact expression and we get the order of the operation s also.

We can get which operation need to be performed first.

15)

we have 2^N+1 - 1 nodes in the perfect binary tree of level n

16)

a node at level n will have n ancestors

17) 2^n can be the max leaves

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.