Register

trees data structure

631 views

1 Answer

1 votes
1 votes
yes ,root node is an internal node.Nodes other than leaf nodes are internal nodes.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
rahul sharma 5 asked Apr 12, 2018
695 views
BST Data Structure
a:) If given Tree is BST => Inorder of keys is sorted b:) Inorder of keys is sorted => Tree is BST(converse of above) I know first one holds.Is second one also true?If not can someone give counter example?
a:) If given Tree is BST = Inorder of keys is sortedb:) Inorder of keys is sorted = Tree is BST(converse of above)I know first one holds.Is second one also true?If not ca...
User Avatar
1 votes
1 votes
1 answer
2
cjoshi asked Jun 26, 2017
549 views
trees in data structure
Q-We are given set of n distinct elements and an unlabled binary tree with n nodes how many ways we can populate the tree with given set so that it becomes binary search tree ?
Q-We are given set of n distinct elements and an unlabled binary tree with n nodes how many ways we can populate the tree with given set so that it becomes binary search...
User Avatar
–4 votes
–4 votes
2 answers
3
Souvik33 asked Oct 27, 2022
636 views
Data Structure- Tree & Graphs
*MSQ* The following figure depicts a a. A tree and only tree b. A tree with 3 nodes c. A graph (Since every tree is a graph) d. A graph and only graph
*MSQ*The following figure depicts a a. A tree and only treeb. A tree with 3 nodesc. A graph (Since every tree is a graph)d. A graph and only graph
User Avatar
0 votes
0 votes
0 answers
4
vijju532 asked Jun 13, 2018
190 views
data structure
how does linux kernel uses the red black tree property ???elabourate
how does linux kernel uses the red black tree property ???elabourate
User Avatar
Link Copied!