Exam 19: Binary Trees
Exam 1: An Overview of Computers and Programming Languages52 Questions
Exam 2: Basic Elements of C++76 Questions
Exam 3: Inputoutput33 Questions
Exam 4: Control Structures I Selection24 Questions
Exam 5: Control Structures II Repetition25 Questions
Exam 6: User-Defined Functions47 Questions
Exam 7: User-Defined Simple Data Types, Namespaces, and the String Type12 Questions
Exam 8: Arrays and Strings33 Questions
Exam 9: Records Structs10 Questions
Exam 10: Classes and Data Abstraction38 Questions
Exam 11: Inheritance and Composition15 Questions
Exam 12: Pointers, Classes, Virtual Functions, Abstract Classes, and Lists40 Questions
Exam 13: Overloading and Templates21 Questions
Exam 14: Exception Handling13 Questions
Exam 15: Recursion18 Questions
Exam 16: Linked Lists17 Questions
Exam 17: Stacks and Queues34 Questions
Exam 18: Searching and Sorting Algorithms28 Questions
Exam 19: Binary Trees26 Questions
Exam 20: Graphs53 Questions
Exam 21: Standard Template Library STL28 Questions
Select questions type
What does these terms refer to:
- Parent:
Free
(Short Answer)
4.9/5
(42)
Correct Answer:
for U and V, two nodes in the binary tree T, U is called the parent of V if there is a branch from U to V
A shallow copy tree has the same number of nodes as the original binary tree.
Free
(True/False)
4.8/5
(33)
Correct Answer:
False
What does these terms refer to:
- Path:
Free
(Short Answer)
4.8/5
(37)
Correct Answer:
a path from a node X to a node Y in a binary tree is a sequence of nodes X0, X1, . . ., Xn such that: (i) X = X0, Xn = Y, (ii) Xi-1 is the parent of Xi for all i = 1, 2, . . ., n; that is, there is a branch from X0 to X1, X1 to X2, . . ., Xi-1 to Xi, . . ., Xn-1 to Xn. If X0, X1, . . ., Xn is a path from node X to node Y, sometimes it is denoted by X = X0 - X1 - … - Xn-1 - Xn = Y or simply X - X1 - … - Xn-1 - Y
Each node in a binary tree can have at most ____________________ link(s).
(Short Answer)
4.7/5
(35)
Explain the difference between a binary tree and a binary search tree.
(Short Answer)
4.8/5
(38)
What are the three primary steps in the preorder traversal algorithm?
(Short Answer)
4.7/5
(36)
Showing 1 - 20 of 26
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)