0
Explain in detail in a binary tree of n nodes there are n plus 1 null pointers representing children?
Malarbe
Induction:
1. A tree of one node has two NULL-pointers.
2. Whenever you add a node to a tree, you remove one NULL-pointer (from the parent of the new node), and add two (the child's of the new node) in the same time.
Wiki User
∙ 12y ago
Wiki User
∙ 14y agoIn a binary tree of N nodes, if all of the nodes have one pointer set to null, then the tree is completely unbalanced, and has the characteristics and performance of a linked list. If you have N+1 null pointers, then the extra node is a special "head" node used to simplify processing of the tree. That "head" node will always have one pointer set to null.
Add your answer:
Earn +20 pts
What are the two methods of representing a binary tree?
Two method of representing a binary tree is Static allocation, and Dynamic allocation
Why is a binary also called flip flop?
Binary is NOT called a flip flop!binary is a mathematical notation for writing numeric values with only 2 symbolsa flip flop is one type of electronic circuit having 2 stable statesThe 2 stable states of a flip flop can be used as one way of physically representing and storing the 2 symbols of binary notation, but there are millions of other circuits and mechanisms that can do the same!
How do you do binary search in file?
A binary search on a random-access file is performed much in the same way as a binary search in memory is performed, with the exception that instead of pointers to items in memory file seek operations are used to locate individual items within the file, then load into memory for further examination. The key aspects of the binary search algorithm do not depend on the specifics of the set of searchable items: the set is expected to be sorted, and it must be possible to determine an order between any two items A and B. Finally, the binary search algorithm requires that the set of searchable items is finite in size, and of a known size.
Why are they no pointers in java?
Pointers are a crucial feature of several programming languages, including C and C++, that allow direct manipulation of memory addresses. Pointers are used to create dynamic data structures, access memory directly, and create efficient algorithms. However, pointers are not available in the Java programming language. In this article, we will explore why pointers are not present in Java and the advantages and disadvantages of this decision. The main reason why pointers are not present in Java is security. Pointers allow direct access to memory addresses, which can be used to manipulate memory in unexpected ways. In Java, memory is managed automatically by the Java Virtual Machine (JVM), which helps to prevent accidental or intentional manipulation of memory. This is important for security, as malicious code could use pointers to gain unauthorized access to sensitive data or systems. By removing pointers, Java ensures that all memory access is controlled and managed, which helps to prevent security threats. Another reason why pointers are not present in Java is the ease of use. Pointers are a complex feature that can be difficult for beginner programmers to understand and use effectively. Java was designed to be an easy-to-use programming language, and by removing pointers, Java makes it easier for beginners to write correct, secure code. Java also makes it easier for programmers to write portable code, as the absence of pointers ensures that code written in Java will work on any device that supports the Java Virtual Machine. However, the absence of pointers in Java also has some disadvantages. One of the main disadvantages is that Java can be slower than languages that support pointers, as the automatic memory management provided by the JVM can be less efficient than direct memory manipulation. When handling large amounts of data, the JVM may not be able to allocate memory as efficiently as a programmer working directly with pointers. When working with pointers, a programmer has complete control over the memory allocation and can optimize it for their specific use case. Another disadvantage of the absence of pointers in Java is that some algorithms and data structures cannot be implemented as efficiently as they can be in languages that support pointers. For example, binary trees can and linked lists and are implemented more efficiently in C or C++, as they can use pointers to link nodes together in memory. Java must use other techniques, such as object references, to implement these structures, which can result in slower and less efficient code. In conclusion, the absence of pointers in Java was a deliberate decision made to improve the security and ease of use of the language. This decision has both advantages and disadvantages, as Java is easier to use and more secure, but it can be slower and less flexible than languages that support pointers. Nevertheless, the popularity of Java and its widespread use in industry and academia demonstrate that the benefits of the absence of pointers outweigh the drawbacks.
A light bulb is used to demonstrate the binary concept used for computer storage and communication Give another example in everyday life to explain this binary concept Get creativ?
Something like a buzzer; if it's making noise, its 1, if it's not, then 0.
What are the two methods of representing a binary tree?
Two method of representing a binary tree is Static allocation, and Dynamic allocation
What does a double-bar graph graphical method representing?
It is a way of representing a variable which is cross-classified and one of these is a binary classification. For example, population classified by age [bands] and gender. Here gender is a binary criterion.
What is a method for representing numbers using only 0 and 1?
binary system
What is a binary numeral system?
A binary numeral system is system for representing numbers in which a radix of 2 is used - so that each digit in a binary numeral may have either of two different values.
What are 3 ways of representing 24?
24, XXIV (Roman numerals) and 11000 (binary code).
What does plus mean in math?
It is a symbol representing addition, one of the basic binary operations in arithmetic.
What is decimal to binary conversion?
"Ordinary" numbers are on base 10 (="decimal"). Binary only has 2 digits. 0 and 1 (representing "on" or "off" in some circuits). So "conversion" is how to represent an number in one to how it appears in the other. So 10 (binary) means 1x21 + 0x20 , which is 2. Decimal to binary effectively means representing an ordinary ("decimal") number in binary form. So 10 (decimal) is broken up into powers of 2 as 8+2 = 1x23 + 0x22 + 1x21 + 0x20 which is 1010 (binary).
Can you show a sentence with binary in it?
The computer reads instructions in binary code, which consists of only ones and zeros representing different on/off states.
What is binary code and why was it chosen to represent data in computers?
Binary code is a base 2 number system, with only the digits 0 and 1. It is used to represent the on/off states of transistors in integrated circuits, with 0 representing off and 1 representing on. So, binary codes represent the possible states of hardware transistors, and the binary codes represent numbers and letters through a coding system like ASCII or EBCDIC.
How many binary digits can one hexadecimal digit represent?
4 digits - representing 16 integers.
What system translates the decimal numbers 0 255 into binary data representing a letter of character on the keyboard?
ASCII
Example in everyday life to explain this binary concept?
Flipping coins.
