Course Content

Other Courses

Tribhuvan university BIT BIT Curriculum Data Structures and Algorithms Old Questions 2079

Data Structures and Algorithms - Old Questions

Question Answer Details
Syllabus Notes Old Questions Unit Wise Questions Question Bank

2. Explain complete binary tree with example. Starting with an empty binary search tree, show the effect of successively adding the following elements: 47, 50, 25, 27, 17, 61, 5, 26. Also, traverse the resulting tree in pre-order, in-order, and post-order. [2+5+3]

10 marks
Asked in 2079

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...