I just want to make sure my answers are correct esp Q2. Thanks! The type of trav

Question

I just want to make sure my answers are correct esp Q2. Thanks!

The type of traversal of a binary tree in which all the nodes of the left subtree of a node are processed, then the node itself is processed, then all the nodes of the right subtree is inorder traversal preorder traversal postorder traversal hyperorder traversal A binary tree may only be traversed using iteration. True False A binary tree can be represented in a non-linked way, using an array. True False The time complexity for locating a value within a binary search tree is O(log_2N) O(N) O(N^2) O (N^3) In terms of complexity (Big-O), it takes longer to destroy a binary search tree than it does a linked (non-array) linked list. True False

Explanation / Answer

1. is inorder i.e. left root right traversal So ans is a)

2. False... It can be traversed using recursion also..

3. True.

4. a) O(logn)

The average time complexity of searching in balanced BST in O(log(n)).

The worst case complexity of searching in unbalanced binary tree is O(n).

5. False

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---