Define leaves

Answer More Questions

1 year ago

Data Structure and Algorithm

These are the terminal nodes of the tree. The nodes with degree 0 are always the

leaves.

Here, B and C are leaf nodes.

5 5

Sanisha Maharjan

Sanisha Maharjan

Jan 23, 2022

More related questions

1. Mention one advantage and disadvantage of using quadratic probing.

2. List the limitations of linear probing.

3. What is the need for extendible hashing?

4. What do you mean by rehashing?

5. What do you mean by double hashing?

6. What do you mean by secondary clustering?

7. What do you mean by quadratic probing?

8. What do you mean by primary clustering?

9. What do you mean by linear probing?

10. What do you mean by Probing?

11. What are the types of collision resolution strategies in open addressing?

12. What do you mean by open addressing?

13. Write the disadvantages of separate chaining.

14. Write the advantage of separate chaining.

15. What do you mean by separate chaining?

16. What are the collision resolution methods?

17. What do you mean by collision in hashing?

18. Write the importance of hashing.

19. What do you mean by hash function?

20. What do you mean by hash table?

21. Define Hashing.

22. Define separate chaining

23. What are the collision resolution methods?

24. What is open addressing?

25. Define hashing function

26. What is binary search?

27. What is meant by linear search?

28. Mention the types of searching

29. Define searching

30. What are the advantages of insertion sort

31. Define radix sort

32. What are the steps in quick sort?

33. What is meant by shell sort?

34. The algorithm proceeds by finding the smallest (or largest, depending on What are the steps for selection sort?

35. What are the steps for selection sort?

36. How the insertion sort is done with the array?

37. Define bubble sort

38. What do you mean by internal and external sorting?

39. Mention the types of sorting

40. Define sorting

41. Define adjacency list.

42. Define Activity node graph.

43. What do you mean by shortest path?

44. What do you mean by articulation point?

45. Define biconnectivity.

46. What do you mean by back edge?

47. What do you mean by tree edge?

48. Differentiate BFS and DFS.

49. What do you mean by breadth first search (BFS)?

50. List the two important key points of depth first search.

51. Define graph traversals.

52. Name two algorithms two find minimum spanning tree

53. What is a minimum spanning tree?

54. What are the two traversal strategies used in traversing a graph?

55. What is an undirected acyclic graph?

56. Namethe different ways of representing a graph?

57. When is a graph said to be weakly connected?

58. What is meant by strongly connected in a graph?

59. What is an acyclic graph?

60. What is a cycle or a circuit?

61. What is a simple path?

62. Define path in a graph?

63. Define indegree of a graph?

64. Define outdegree of a graph?

65. What is a weighted graph?

66. What is a simple graph?

67. What is a loop?

68. What is an undirected graph?

69. What is a directed graph?

70. Define adjacent nodes.

71. Define Graph.

72. What is the idea behind splaying?

73. Define splay tree.

74. What do you mean by balance factor of a node in AVL tree?

75. What are the categories of AVL rotations?

76. What do you mean by balanced trees?

77. Define AVL Tree.

78. In the given binary tree, using array you can store the node 4 at which location?

79. Traverse the given tree using Inorder, Preorder and Postorder traversals.

80. What is the use of threaded binary tree?

81. Define a binary search tree

82. State the demerits of linked representation of binary trees.

83. State the merit of linked representation of binary trees.

84. State the demerit of linear representation of binary trees.

85. State the merits of linear representation of binary trees.

86. What are the tasks performed during postorder traversal?

87. What are the tasks performed during inorder traversal?

88. What are the different binary tree traversal techniques?

89. What is meant by binary tree traversal?

90. State the properties of a binary tree

91. Define a complete binary tree

92. Define a full binary tree

93. Define a path in a tree

94. Define a binary tree

95. Define forest

96. What do you mean by level of the tree?

97. Define depth and height of a tree

98. Define depth and height of a node

99. Define parent node

100. Define internal nodes

101. Define degree of the node

102. Define root

103. Define a tree

104. What is the need for Priority queue?

105. Define a Deque

106. State the difference between queues and linked lists

107. Define a priority queue

108. Define a queue

109. Mention the advantages of representing stacks using linked lists than arrays

110. Mention the advantages of representing stacks using linked lists than arrays

111. State the rules to be followed during infix to postfix conversions

112. State the different ways of representing expressions

113. List out the basic operations that can be performed on a stack

114. Define a stack

115. List the applications of queues

116. List the applications of stacks

117. What are the types of queues?

118. What are the objectives of studying data structures?

119. What are the advantages of modularity?

120. Define an Abstract Data Type (ADT)

121. State the difference between arrays and linked lists

122. List out the applications of a linked list

123. List out the disadvantages of using a linked list

124. List out the advantages of using a linked list

125. List the basic operations carried out in a linked list

126. State the different types of linked lists

127. Define Linked Lists

128. Define Data Structures

129. How do you search for a target key in a linked list?

130. Briefly explain recursive algorithm.

131. What is Fibonacci search?

132. What is Huffman’s algorithm?

133. What are doubly linked lists?

134. What is an AVL tree?

135. Differentiate linear from a nonlinear data structure.

136. What is a graph?

137. How does selection sort work?

138. What are the parts of a linked list?

139. What is a bubble sort and how do you perform it?

140. What is a dequeue?

141. Give a basic algorithm for searching a binary search tree.

142. Differentiate STACK from ARRAY.

143. Which sorting algorithm is considered the fastest?

144. What is the minimum number of queues needed when implementing a priority queue?

145. What are ARRAYs?

146. Do all declaration statements result in a fixed reservation in memory?

147. In what data structures are pointers applied?

148. What are dynamic data structures?

149. What is the minimum number of nodes that a binary tree can have?

150. How do signed and unsigned numbers affect memory?

151. How does a selection sort work for an array?

152. How do you insert a new item in a binary search tree?

153. What is Data abstraction?

154. What is a postfix expression?

155. What is the advantage of the heap over a stack?

156. How does variable declaration affect memory allocation?

157. What is a linear search?

158. What is the difference between a PUSH and a POP?

159. What is the primary advantage of a linked list?

160. Differentiate NULL and VOID

161. What is merge sort?

162. What is an ordered list?

163. What is FIFO?

164. How does dynamic memory allocation help in managing data?

165. Are linked lists considered linear or non-linear data structures?

166. What are multidimensional arrays?

167. Explain Binary Search Tree.

168. What is a stack?

169. Which data structures are applied when dealing with a recursive function?

170. What are binary trees?

171. What is a queue?

172. What is LIFO?

173. In what areas do data structures are applied?

174. How do you reference all the elements in a one-dimension array?

175. What is a linked list?

176. When is a binary search best applied?

177. Differentiate between file and structure storage structure.

178. What is data structure?

Questions Bank

View all Questions