Hashing Binary search, Linear search and all other searches key are totally dependent on the number of elements and so many keys comparison are involved. Now, our need is to search the element in constant time and less key comparison should be involved. Hashing… Read more
Threaded Binary Tree A tree can be represented by using Array Representation OR Linked List Representation Using Array Representation In array representation to represent the Binary tree we take One Dimensional Array. Maximum size of array = 2n+1… Read more
TREES TREE TERMINOLOGY :- TYPES OF TREES:- 1 : BINARY TREE =Degree of any node in binary tree is (0,1,2) 2 : STRICTLY BINARY TREE(SBT)=Degree of any node in SBT is (0,,2) 3 : COMPLETE … Read more