Write the recursive c function to count the number of nodes present in a binary tree.
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
Which sorting algorithm is worst?
do records fall under linear or non linear data structures?
What type of data structure is used to perform recursion?
What are the Difference between tcp and udp?
What is linked hash set?
How many links are there in a binary tree of N nodes?
Define open addressing?
What is b tree in data structure?
how to insert a new node in linked list where free node will be available?
What do you mean by collision in hashing?
State the advantages of using postfix notations?