Monika Asked a Question
January 30, 2022 5:16 pmpts 30 pts
exiy 1. A binary search tree contains the values 1, 2, 3, 4, 5, 6, 7, 8. The tree is traversed in pre-order and the val ues are printed out. Which of the following is a valid output? (A) 53124786 (C) 53241678 (B) 53126487 (D) 53124768 Cor RRK
  • 1 Answer(s)
  • 0 Likes
  • 1 Comments
  • Shares
  • Aparna 1 thankyou
    Preorder means Root-Left-Right or Node-Left-Right(NLR) sequence of the traversal of elements. In Binary search tree, left sided elements are smaller then the root and right sided ...
    Show more
    • cropped9027903669209352784.jpg
    • cropped4878982007784643799.jpg
    Likes(0) Reply(0)