Data Structures Unit 4 Notes AKTU (BCS301)

AKTU · BTECH · Semester 3 · Data Structures · Unit 4 · Notes

AKTU Data Structures (BCS301) Unit 4 notes for B.Tech Semester 3 – Trees. Topics: Trees & Binary Trees, Binary Search Tree (BST), Threaded Binary Trees…

Open the interactive reader to study this resource on AcademicArk.

Unit 4: Trees – AKTU syllabus topics

  • Trees & Binary Trees: Tree Traversal (Inorder, Preorder, Postorder)
  • Binary Search Tree (BST)
  • Threaded Binary Trees
  • AVL, B-Trees & Binary Heaps
  • Huffman Coding

Most asked AKTU PYQ questions from Unit 4

  1. Q2e. What is the significance of maintaining threads in Binary Search Tree? Write an algorithm to insert a node in thread binary tree. (10 marks, 2021-22)
  2. Q1g. Illustrate the significance of Threaded Binary Tree. (2 marks, 2024-25)
  3. Q1i. What is the importance of threaded binary tree? (2 marks, 2020-21)
  4. Q1j. Explain threaded binary tree. (2 marks, 2019-20)
  5. Q2e. The order of nodes of a binary tree in inorder and postorder traversal are as follows: In order : B, I, D, A, C, G, E, H, F. Post order: I, D, B, G, C, H, F, E, A. (i) Draw the corresponding binary tree. (ii) Write the pre order traversal of the same tree. (10 marks, 2022-23)
  6. Q7b. What is B-Tree? Write the various properties of B- Tree. Show the results of inserting the keys F, S, Q, K ,C, L, H, T, V, W, M, R, N, P, A, B in order into a empty B-Tree of order 5. (10 marks, 2022-23)
  7. Q7a. Can you find a unique tree when any two traversals are given? Using the following traversals construct the corresponding binary tree: INORDER: H K D B I L E A F C M J G PREORDER: A B D H K E I L C F G J M Also find the Post Order traversal of obtained tree. (10 marks, 2019-20)
  8. Q7b. What is a B-Tree? Generate a B-Tree of order 4 with the alphabets (letters) arrive in the sequence as follows: a g f b k d h m j e s i r x c l n t u p (10 marks, 2019-20)
  9. Q2c. Construct a binary tree with the following traversals: Inorder: B C A E G D H F I J Preorder: A B C D E G F H I J (7 marks, 2024-25)
  10. Q7a. (i) Why does time complexity of search operation in B-Tree is better than Binary Search Tree (BST)? (ii) Insert the following keys into an initially empty B-tree of order 5 a, g, f, b, k, d, h, m, j, e, s, i, r, x, c, l, n, t, u, p (iii) What will be the resultant B-Tree after deleting keys j, t… (10 marks, 2021-22)

AKTU paper codes: BCS301, KCS301, BCS301H, KCS301H

Other Data Structures units

Data Structures previous year papers

More Data Structures resources

More versions of this resource

Browse all notes · Semester 3 notes