• edited by
17 views
1 1 vote

Consider a binary search tree (BST). Which one of the following properties is always true for an inorder traversal of the BST?

  1. It gives the nodes in descending order of values of keys
  2. It only visits the leftmost and rightmost nodes
  3. It gives the nodes in random order of values of keys
  4. It gives the nodes in ascending order of values of keys

Please log in or register to answer this question.

Position:
Show:

Related questions

1 1 vote
0 0 answers
23
23 views
Shubham Sharma 2 asked Sep 15
23 views
What is the initial value of top in an empty stack implemented using an array?$0$$-1$$1$Depends on stack size
0 0 votes
0 0 answers
16
16 views
Shubham Sharma 2 asked Sep 15
16 views
A banking transaction commits successfully, but a system crash occurs immediately afterward. Which mechanism ensures durability?LockingPartial commitTransaction isolation...
0 0 votes
0 0 answers
18
18 views
Shubham Sharma 2 asked Sep 15
18 views
Consider a finite state transducer (FST) with $Q=\left\{q_{0}, q_{1}\right\}, \Sigma=\{0,1\}, \Gamma=\{a, b$, $\mathrm{c}\}$, initial state $\mathrm{q}_{0}$, and the foll...
1 1 vote
0 0 answers
18
18 views
Shubham Sharma 2 asked Sep 15
18 views
In a memory system with fixed-sized partitions, each holding one process (as in IBM OS$/360$ MFT).Which statement is correct?Multiprogramming limited; internal fragmentat...