Scribd
Upload
20 views

Unit - 3 (2 Marks)

Data structures unit 3 two marks

Uploaded by

alphaashwin1526
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
20 views

Unit - 3 (2 Marks)

Data structures unit 3 two marks

Uploaded by

alphaashwin1526
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 8
*S Trees ANNA UNIVERSITY PART A QUESTIONS 1, How to resolve null links in a binary tree? (Apr/May 2019 a ) The number of null links ina binary tree of n nodes i (nt+] les is (n+l), 3, The depth of complete bi i number of nodes in leaf. Mr ead ar May 2815) pr/May 2019) A complete binary tree can have ' : : at most (2" - : where h is the height of the tree. (2" — 1) nodes in total nN 3 pletion some problems for which heaps are more pp! le. (Nov/ Dec 2021) A heap tree can be used for many different purposes, including the following: « Djikstra's Algorithm, which is used to find the shortest path between two nodes in a graph. « Heap Sort algorithm. « Implementing priority queues. + Finding the smallest or largest element in an array. 4. Define Binary search tree. (Nov/Dec 2019) Binary search tree is a binary tree in which for every node X in the tree, the values of all the keys in its left subtree are smaller than the key value in X and the values of all the keys in its right subtree and larger than the key value in X. 5, What do you mean by level of the tree. (Nov/Dec 2019) * Inatree, each step from top to bottom is called as level of a tree. 131 & scanned with OKEN Scanner 4 Data Structures i i its by 1 at © The level count starts with 0 and increments by | a each level, step. 6. Define tree? are non-liner data structure. It represents any hierarchiog Trees : rees m. It is a collection of nodes, Which relationship between any data Ite has a distinguish node called the root node and zero or more nop, root nodes. 7. Define Path of a node? A path from node ni to nk is defined as a sequence of nodts 1j,n2,0s,...-Mk, Such that n1 is the parent of nist for 1

You might also like