Answer Posted / duchinna198227
A tree with at most two children for each node.
OR
A binary tree either
* is empty (no nodes), or
* has a root node, a left binary tree, and a right
binary tree.
| Is This Answer Correct ? | 32 Yes | 3 No |
Post New Answer View All Answers
List some applications of queue data structure.
What are the differences between b tree and b+ tree?
Explain linked list in short.
What actions are performed when a function returns?
How do you rotate an AVL tree?
What is a spanning tree in data structure?
Write the stack overflow condition.
What are the different types of hash functions?
What’s the difference between enumeration and iterator interfaces?
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).
How will you free the memory that is allocated at run time?
What is data structure and data type?
Define static data structures?
Why do we use data structures?
How to get a list of tables, views and columns in firebird database?
